Skip to Main content Skip to Navigation
New interface
Conference papers

From Transitions to Executions

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 15, 2017 - 3:02:49 PM
Last modification on : Friday, June 28, 2019 - 3:01:15 PM
Long-term archiving on: : Wednesday, December 13, 2017 - 12:19:39 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads