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.

Publication DOI:
Funding Information: We would like to thank the anonymous reviewers for their detailed comments and suggestions. This work has been partially supported by: Aut. Reg. of Sardinia grants L.R.7/2007 CRP-17285 (TRICS) and P.I.A. 2010 (?Social Glue?), by MIUR PRIN 2010-11 project
Additional Information: © 2015 The Authors
Uncontrolled Keywords: Software
Publication ISSN: 2075-2180
Last Modified: 09 Jul 2024 07:06
Date Deposited: 19 Aug 2019 07:57
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
PURE Output Type: Conference article
Published Date: 2015-08-19
Authors: Scalas, Alceste (ORCID Profile 0000-0002-1153-6164)
Bartoletti, Massimo



Version: Published Version

| Preview

Export / Share Citation


Additional statistics for this record