Labelled Execution Systems
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 actually 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 Details
- Document Type
- Technical Report
- Publication Date
- May 07, 2012
- Accession Number
- ADA561739
Entities
People
- Edward A. Lee
- Eleftherios Matsikoudis
Organizations
- University of California, Berkeley