Ready simulation for concurrency: it's logical!

  • This paper provides new insight into the connection between the trace-based lower part of van Glabbeek's linear-time, branching-time spectrum and its simulation-based upper part. We establish that ready simulation is fully-abstract with respect to failures inclusion, when adding the conjunction operator that was proposed by the authors in [FOSSACS '06] to the standard setting of labelled transition systems with (CSP-style) parallel composition. More precisely, we actually prove a stronger result by considering a coarser relation than failures inclusion, namely a preorder that relates processes with respect to inconsistencies that may arise under conjunctive composition. Ready simulation is also shown to satisfy standard logic properties and thus commends itself as the semantics of choice for studying mixed operational and logic languages.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Gerald LüttgenGND, Walter VoglerGND
URN:urn:nbn:de:bvb:384-opus4-3925
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/486
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2007-04)
Type:Report
Language:English
Publishing Institution:Universität Augsburg
Release Date:2007/05/04
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik / Professur für Theorie verteilter Systeme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik