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
Liste complète des métadonnées

https://hal.inria.fr/hal-01539888
Contributor : Hal Ifip <>
Submitted on : Thursday, June 15, 2017 - 3:02:49 PM
Last modification on : Thursday, June 15, 2017 - 3:25:49 PM
Document(s) archivé(s) le : Wednesday, December 13, 2017 - 12:19:39 PM

File

978-3-642-32784-1_10_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Eleftherios Matsikoudis, Edward 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⟩

Share

Metrics

Record views

121

Files downloads

15