The LTS WorkBench
Logic in Computer Science
2015-08-21 v1 Programming Languages
Software Engineering
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.
Cite
@article{arxiv.1508.04853,
title = {The LTS WorkBench},
author = {Alceste Scalas and Massimo Bartoletti},
journal= {arXiv preprint arXiv:1508.04853},
year = {2015}
}
Comments
In Proceedings ICE 2015, arXiv:1508.04595