Author of the publication

CPN/Tools: A Tool for Editing and Simulating Coloured Petri Nets ETAPS Tool Demonstration Related to TACAS.

, , , , , , , , , , , , and . TACAS, volume 2031 of Lecture Notes in Computer Science, page 574-577. Springer, (2001)

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

Decidability issues for infinite-state processes- a survey., and . Bulletin of the EATCS, (1993)Modular Analysis of Petri Nets., and . Comput. J., 43 (3): 224-242 (2000)Teaching Coloured Petri Nets: Examples of Courses and Lessons Learned., and . Lectures on Concurrency and Petri Nets, volume 3098 of Lecture Notes in Computer Science, page 402-412. Springer, (2003)Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs., and . Application and Theory of Petri Nets, volume 691 of Lecture Notes in Computer Science, page 186-205. Springer, (1993)Modular State Space Analysis of Coloured Petri Nets., and . Application and Theory of Petri Nets, volume 935 of Lecture Notes in Computer Science, page 201-217. Springer, (1995)Coloured Petri Nets Extended with Channels for Synchronous Communication., and . Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, page 159-178. Springer, (1994)Design As Interaction with Computer Based Materials., , and . Symposium on Designing Interactive Systems, page 65-71. ACM, (1997)A Logical Characterization of Asynchronously Communicating Agents.. LFCS, volume 620 of Lecture Notes in Computer Science, page 93-104. Springer, (1992)Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems.. CONCUR, volume 630 of Lecture Notes in Computer Science, page 148-161. Springer, (1992)Bisimulation Equivalence is Decidable for all Context-Free Processes., , and . CONCUR, volume 630 of Lecture Notes in Computer Science, page 138-147. Springer, (1992)