(Bi)simulations up-to characterise process semantics
From MaRDI portal
Publication:1012122
DOI10.1016/j.ic.2007.12.003zbMath1165.68054OpenAlexW2044267876MaRDI QIDQ1012122
Carlos Gregorio Rodríguez, David de Frutos-Escrig
Publication date: 14 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.12.003
bisimulations up-tocanonical preorderlinear time-branching time spectrumsemantic equivalencessemantic preorderssimulations up-to
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
The quantitative linear-time-branching-time spectrum, Axiomatizing weak simulation semantics over BCCSP, Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences, Ready to preorder: the case of weak process semantics, Axiomatizing Weak Ready Simulation Semantics over BCCSP
Cites Work
- Simulations in coalgebra
- Ready to preorder: an algebraic and general proof
- CCS expressions, finite state processes, and three problems of equivalence
- Specification-oriented semantics for communicating processes
- Extensional equivalences for transition systems
- Bisimulation through probabilistic testing
- A structural approach to operational semantics
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Power simulation and its relation to traces and failures refinement
- Testing equivalence as a bisimulation equivalence
- New up-to techniques for weak bisimulation
- Simulations Up-to and Canonical Preorders
- Ready to Preorder: Get Your BCCSP Axiomatization for Free!
- New Bisimulation Semantics for Distributed Systems
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- Process Algebra
- On the bisimulation proof method
- Bisimulation can't be traced
- A bisimulation for type abstraction and recursion
- Small bisimulations for reasoning about higher-order imperative programs
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
- Mathematical Foundations of Computer Science 2003
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Foundations of Software Science and Computational Structures
- Weak Bisimulation Up to Elaboration
- Generic Forward and Backward Simulations
- CONCUR 2005 – Concurrency Theory
- CONCUR 2003 - Concurrency Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
