论文信息 - The LTS WorkBench

The LTS WorkBench

Labelled Transition Systems (LTSs) are a fundamental semantic model in many areas of informatics, especially concurrency theory. Yet, reasoning on LTSs and relations between their states can be difficult and elusive: very simple process algebra terms can give rise to a large (possibly infinite) number of intricate transitions and interactions. To ease this kind of study, we present LTSwb, a flexible and extensible LTS toolbox: this tutorial paper discusses its design and functionalities.

Alceste Scalas | Massimo Bartoletti

[1] Jeff Magee,et al. Concurrency - state models and Java programs (2. ed.) , 2006 .

[2] Martin Odersky,et al. An Overview of the Scala Programming Language , 2004 .

[3] Alceste Scalas,et al. A Semantic Deconstruction of Session Types , 2014, CONCUR.

[4] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[5] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[6] Jeff Magee,et al. Concurrency - state models and Java programs , 2006 .

[7] Kohei Honda,et al. Types for Dyadic Interaction , 1993, CONCUR.

[8] Rance Cleaveland,et al. A Front-End Generator for Verification Tools , 1995, TACAS.

[9] Rance Cleaveland,et al. The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[10] Mario Bravetti,et al. Contract based multi-party service composition , 2007, FSEN'07.

[11] Erik P. de Vink,et al. An Overview of the mCRL2 Toolset and Its Recent Advances , 2013, TACAS.

[12] Anna Philippou,et al. Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[13] Luca Padovani,et al. A theory of contracts for Web services , 2007, TOPL.

[14] Radu Mateescu,et al. CADP 2011: a toolbox for the construction and analysis of distributed processes , 2012, International Journal on Software Tools for Technology Transfer.

[15] Daniel Brand,et al. On Communicating Finite-State Machines , 1983, JACM.