Accession Number:

ADA561739

Title:

Labelled Execution Systems

Descriptive Note:

Technical rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE

Personal Author(s):

• Matsikoudis, Eleftherios
• Lee, Edward A.

Report Date:

2012-05-07

Pagination or Media Count:

59.0

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.

Descriptors:

• *ALGEBRAIC FUNCTIONS
• *COMPUTER PROGRAMS
• *TRANSITIONS
• SEQUENCES
• THEORY

Subject Categories:

• Numerical Mathematics
• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE