From Transitions to Executions - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2012

From Transitions to Executions


Interleaving theories have traditionally failed to integrate a satisfactory treatment of the so-called “finite delay property”. This is generally attributed to the expansion law of such theories, but in truth, the problem is rooted in the concept of labelled transition system. We introduce a new type of system, in which, instead of labelled transitions, we have, essentially, sequences of labelled transitions. We call systems of this type labelled execution systems. We use a coalgebraic representation to obtain, in a canonical way, a suitable concept of bisimilarity among such systems, study the conditions under which that concept agrees with the intuitive understanding of equivalence of branching structure that one has for these systems, and examine their relationship with labelled transition systems, precisely characterizing the difference in expressive power and branching complexity between the two kinds of systems.
Fichier principal
Vignette du fichier
978-3-642-32784-1_10_Chapter.pdf (410.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01539888 , version 1 (15-06-2017)





Eleftherios Matsikoudis, Edward A. Lee. From Transitions to Executions. 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Mar 2012, Tallinn, Estonia. pp.170-190, ⟨10.1007/978-3-642-32784-1_10⟩. ⟨hal-01539888⟩
93 View
44 Download



Gmail Facebook X LinkedIn More