Author of the publication

Specification and Validation of a Simple Overtaking Protokol using LOTOS.

, , and . FORTE, volume C-2 of IFIP Transactions, page 377-392. North-Holland, (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Ensuring completeness of symbolic verification methods for infinite-state systems., and . Theor. Comput. Sci., 256 (1-2): 145-167 (2001)Handling Global Conditions in Parameterized System Verification., , , and . CAV, volume 1633 of Lecture Notes in Computer Science, page 134-145. Springer, (1999)Assume-Guarantee Reasoning for Safe Component Behaviours., , and . FACS, volume 7684 of Lecture Notes in Computer Science, page 92-109. Springer, (2012)Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations., and . ILPS, page 335-352. MIT Press, (1993)Fully Abstract Characterization of Probabilistic May Testing., and . ARTS, volume 1601 of Lecture Notes in Computer Science, page 1-18. Springer, (1999)General Decidability Theorems for Infinite-State Systems., , , and . LICS, page 313-321. IEEE Computer Society, (1996)Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction., , and . ICTSS, volume 6435 of Lecture Notes in Computer Science, page 188-204. Springer, (2010)A Model and Proof System for Asynchronous Networks.. PODC, page 49-58. ACM, (1985)Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata., , , , , and . ATVA, volume 8172 of Lecture Notes in Computer Science, page 224-239. Springer, (2013)Transitive Closures of Regular Relations for Verifying Infinite-State Systems., and . TACAS, volume 1785 of Lecture Notes in Computer Science, page 220-234. Springer, (2000)