The LTS WorkBench
This is an incremental tool for researchers in informatics and concurrency theory to ease the study of LTSs.
The paper tackles the difficulty of reasoning on Labelled Transition Systems (LTSs) in concurrency theory by presenting LTSwb, a flexible and extensible toolbox, and discusses its design and functionalities.
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.