Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Communication and Concurrency
Simulation preorder over simple process algebras
Information and Computation
Global Timed Bisimulation: An Introduction
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Power simulation and its relation to traces and failures refinement
Theoretical Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
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
(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)
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Hi-index | 0.00 |
Coinductive definitions of semantics based on bisimulations have rather pleasant properties and are simple to use. In order to get coinductive characterisations of those semantic equivalences that are weaker than strong bisimulation we use a variant of the bisimulation up-to technique in which we allow the use of a given preorder relation. We prove that under some technical conditions our bisimulations up-to characterise the kernel of the given preorder. It is remarkable that the adequate orientation of the ordering relation is crucial to get this result. As a corollary, we get nice coinductive characterisations of all the axiomatic semantic equivalences in Van Glabbeek's spectrum. Although we first prove our results for finite processes, reasoning by induction, then we see, by using continuity arguments, that they are also valid for infinite (finitary) processes.