The LTS WorkBench
Alceste Scalas (Universit\`a di Cagliari, Italy, Imperial College, London, UK), Massimo Bartoletti (Universit\`a di Cagliari, Italy)
TL;DR
The paper introduces LTSwb, a flexible and extensible toolbox designed to facilitate reasoning and analysis of Labelled Transition Systems, which are fundamental in concurrency theory but often complex to study.
Contribution
It presents the design and functionalities of LTSwb, a new toolbox that simplifies working with complex LTSs in various areas of informatics.
Findings
LTSwb enhances ease of reasoning about LTSs.
It supports analysis of large and complex transition systems.
The toolbox is flexible and extensible for different research needs.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.