Labeled Transition Systems

Labeled transition systems are presented as a suitable interleaving semantic model for distributed systems. Some notions of behavioral equivalence are discussed, such as isomorphism equivalence, trace equivalence, and bisimulation equivalence. The non-interleaving model of step transition systems is...

Full description

Saved in:
Bibliographic Details
Published inProcess Algebras for Petri Nets pp. 15 - 34
Main Author Gorrieri, Roberto
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2017
Springer International Publishing
SeriesMonographs in Theoretical Computer Science. An EATCS Series
Subjects
Computer science
Mathematical foundations
Software Engineering
Online AccessGet full text
ISBN9783319555584
3319555588
ISSN1431-2654
2193-2069
DOI10.1007/978-3-319-55559-1_2

Cover

More Information
Summary:Labeled transition systems are presented as a suitable interleaving semantic model for distributed systems. Some notions of behavioral equivalence are discussed, such as isomorphism equivalence, trace equivalence, and bisimulation equivalence. The non-interleaving model of step transition systems is also introduced.
ISBN:9783319555584
3319555588
ISSN:1431-2654
2193-2069
DOI:10.1007/978-3-319-55559-1_2