Verification of Timed Algorithms

Citation:	Danièle Beauquier and Anatol Slissenko, "Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic". In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, eds., Abstract State Machines -- ASM 2000, International Workshop on Abstract State Machines, Monte Verita, Switzerland, Local Proceedings, TIK-Report 87, Swiss Federal Institute of Technology (ETH) Zurich, March 2000, 22--39.
Summary:	A survey of work by the authors on specification and verification of timed algorithms using ASMs and continuous time.
Subjects:	Benchmark Examples, Distributed Systems, Real-Time Systems, Verification
Download:	PostScript, PDF, Compressed PostScript
Notes:	Papers discussed in this survey include prior work by the authors on continuous time and model checking of the railroad crossing problem. Official version appears in Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, eds., Abstract State Machines: Theory and Applications, Springer LNCS 1912, 2000, 34-49.

[an error occurred while processing this directive]

Abstract State Machines