Computable processes and bisimulation equivalence:

Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification languag...

Full description

Saved in:
Bibliographic Details
Main Author: Ponse, Alban (Author)
Format: Book
Language:English
Published: Amsterdam 1992
Series:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,7
Subjects:
Summary:Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification language [mu]CRL (micro Common Representation Language) is used. Two simple fragments of [mu]CRL are singled out, yielding universal expressivity with respect to recursive and primitive recursive transition systems over a fixed, finite label set
For all transition systems defined by a [mu]CRL specification over the recursive fragment, and for the class of all primitive recursive transition systems over some finite label set, the properties 'bisimilarity', 'deadlock freedom' and 'regularity' (i.e., having a bisimilar finite representation) are classified in the arithmetical hierarchy. Finally it is shown that in the domain of primitive recursive transition systems over a fixed, finite label set, a genuine hierarchy in bisimilarity can be defined via the complexity of the witnessing relations.
Physical Description:28 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!