A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
A logic for the description of nondeterministic programs and their properties
Information and Control
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Handbook of theoretical computer science (vol. B)
Selected papers of the 3rd workshop on Concurrency and compositionality
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Handbook of Process Algebra
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
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
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Conjunction on processes: full–abstraction via ready–tree semantics
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A compositional specification theory for component behaviours
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Hi-index | 0.00 |
This article 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 failure 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 failure 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. In addition, our semantic formalism proves itself robust when adding disjunction, external choice and hiding operators, and is thus suited for studying mixed operational and logic languages. Finally, the utility of our formalism is demonstrated by means of a small example that deals with specifying and reasoning about mode logics within aircraft control systems.