The LTS WorkBench

Alceste Scalas; Massimo Bartoletti

doi:10.4204/EPTCS.189.8

The LTS WorkBench

Alceste Scalas, Massimo Bartoletti

Research output: Contribution to journal › Conference article › peer-review

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	https://doi.org/10.4204/EPTCS.189.8
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

Access to Document

10.4204/EPTCS.189.8

The LTS WorkBenchFinal published version, 294 KB

Cite this

@article{4017ab63b24f4818aaa56948cd1bf3ef,

title = "The LTS WorkBench",

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.",

author = "Alceste Scalas and Massimo Bartoletti",

note = "{\textcopyright} 2015 The Authors; 8th Interaction and Concurrency Experience, ICE 2015 ; Conference date: 04-06-2015 Through 05-06-2015",

year = "2015",

month = aug,

day = "19",

doi = "10.4204/EPTCS.189.8",

language = "English",

volume = "189",

pages = "86--98",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - The LTS WorkBench

AU - Scalas, Alceste

AU - Bartoletti, Massimo

PY - 2015/8/19

Y1 - 2015/8/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957709676&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.189.8

DO - 10.4204/EPTCS.189.8

M3 - Conference article

AN - SCOPUS:84957709676

SN - 2075-2180

VL - 189

SP - 86

EP - 98

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 8th Interaction and Concurrency Experience, ICE 2015

Y2 - 4 June 2015 through 5 June 2015

ER -

The LTS WorkBench

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this