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.
| Original language | English |
|---|---|
| Pages (from-to) | 86-98 |
| Number of pages | 13 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 189 |
| DOIs | |
| Publication status | Published - 19 Aug 2015 |
| Event | 8th Interaction and Concurrency Experience, ICE 2015 - Grenoble, France Duration: 4 Jun 2015 → 5 Jun 2015 |
Bibliographical note
© 2015 The AuthorsFunding
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 ?Security Horizons?, by EU COST Action IC1201 ?Behavioural Types for Reliable Large-Scale Software Systems? (BETTY), and by EPSRC grant EP/K011715/1.