Communicating sequential processes
Communicating sequential processes
Extensional equivalence for transition systems
Acta Informatica
Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Algebraic theory of processes
Bisimulation through probabilistic testing
Information and Computation
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Communication and Concurrency
Testing Equivalence for Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
(Bi)simulations up-to characterise process semantics
Information and Computation
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper we define simulations up-to a preorder and show how we can use them to provide a coinductive, simulation-like, characterization of semantic preorders for processes. The result applies to a wide class of preorders, in particular to all semantic preorders coarser than the ready simulation preorder in the linear time-branching time spectrum. An interesting but unexpected result is that, when built from an equivalence relation, the simulation up-to is a canonical preorder whose kernel is the given equivalence relation. These canonical preorders have several nice properties, the main being that since all of them are defined in a homogeneous way, their properties can be proved in a generic way. In particular, we present an axiomatic characterization of each of these canonical preorders, that is obtained just by adding a single axiom to the axiomatization of the original equivalence relation. This gives us an alternative axiomatization for every axiomatizable preorder in the linear time-branching time spectrum, whose correctness and completeness can be proved once and for all.