Ready simulation for concurrency: it's logical!

Authors:
Gerald Lüttgen;Walter Vogler
Affiliations:
Department of Computer Science, University of York, York, U.K;Institut für Informatik, Universität Augsburg, Augsburg, Germany
Venue:
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Year:
2007

Citing 14
Cited 1

Communicating sequential processes

Communicating sequential processes
A logic for the description of nondeterministic programs and their properties

Information and Control
Specification-oriented semantics for communicating processes

Acta Informatica
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
A logical view of composition

Selected papers of the 3rd workshop on Concurrency and compositionality
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Bisimulation can't be traced

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Handbook of Process Algebra

Handbook of Process Algebra
Consistency of Partial Process Specifications

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Possible Worlds for Process Algebras

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Conjunction on processes: Full abstraction via ready-tree semantics

Theoretical Computer Science

Safe Reasoning with Logic LTS

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides new insight into the connection between the trace-based lower part of van Glabbeek's linear-time, branchingtime 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 [TCS 373(1-2):19-40] 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 for studying mixed operational and logic languages.