On verification of refinements of timed distributed algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1912 LNCS, Issue , 2000, Pages 34-49

  Cohen, J ^a   Slissenko, A ^a,b  

^a 1 UniversityParis 12 Dept of Informatics ^*  (France)

^b ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; DISCRETE TIME CONTROL SYSTEMS; SEMANTICS;

ABSTRACT STATE MACHINES; ASYNCHRONOUS ALGORITHMS; BAKERY ALGORITHM; DISCRETE TIME; INTERPROCESS COMMUNICATION; MESSAGE EXCHANGE; REAL TIME CONSTRAINTS; CONTINUOUS-TIME;

ALGORITHMS;

EID: 84889605505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44518-8_4     Document Type: Conference Paper

References (9)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Technical Report 29, DEC Systems Research Center, Palo Alto, California, August, 14 1988.
2. E. Borger, Y. Gurevich, and D. Rozenzweig. The bakery algorithm: Yet another specification and verification. In E. Börger, editor, Specification and Validation Methods, pages 231-243. Oxford University Press, 1995.
3. M. Broy. Compositional refinement of interactive systems. J. of the Assoc. Comput. Mach, 44(6):850-891, 1997.
4. D. Beauquier and A. Slissenko. A first order logic for specification of timed algorithms: Basic properties and a decidable class. 37 pages, 1999. To appear in J. of Pure and Applied Logic.
5. G. Goos, A. Heberle, W. Loewe, and W. Zimmermann. On modular de-initions and implementations of programming languages. In Proc. of the Intern. Workshop on Abstract State Machines (ASM'2000), March 20-24, 2000, Switzerland, Monte Veritá, Ticino, pages 174-208. ETH, Zürich, 2000.
6. Y. Gurevich. Evolving algebra 1993: Lipari guide. In E. Böorger, editor, Specification and Validation Methods, pages 9-93. Oxford University Press, 1995.
7. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of ACM, 17(8):453-455, 1974.
8. J. Ostroff. Composition and refinement of discrete real-time systems. ACM Trans. on Software Engineering and Methodology, 8(1):1-48, 1999.
9. M. Wirsing. Algebraic specification. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics, pages 677-788. Elsevier Science Publishers B.V., 1990.