(Bi)simulations up-to characterise process semantics
type: Item
instance of: scholarly article
title: (Bi)simulations up-to characterise process semantics
zbMATH Open document ID: 1165.68054
author: Carlos Gregorio Rodríguez
author: David de Frutos Escrig
published in: Information and Computation
publication date: 2009-04-14T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5543803
zbMATH Keywords: semantic equivalences
zbMATH Keywords: semantic preorders
zbMATH Keywords: bisimulations up-to
zbMATH Keywords: simulations up-to
zbMATH Keywords: canonical preorder
zbMATH Keywords: linear time-branching time spectrum
MaRDI profile type: Publication
full work available at URL: j.ic.2007.12.003
OpenAlex ID: W2044267876
cites work: CONCUR 2005 – Concurrency Theory
cites work: Simulations up-to and canonical preorders (extended abstract)
cites work: Q3777424
cites work: Q3992568
cites work: Process Algebra
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Q3992422
cites work: Foundations of Software Science and Computational Structures
cites work: Formal Techniques for Networked and Distributed Systems - FORTE 2005
cites work: Q3662610
cites work: Q3997501
cites work: Q4218096
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Three Partition Refinement Algorithms
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Q3907077
cites work: A bisimulation for type abstraction and recursion
cites work: Small bisimulations for reasoning about higher-order imperative programs
cites work: Specification-oriented semantics for communicating processes
cites work: Bisimulation through probabilistic testing
cites work: Bisimulation can't be traced
cites work: Ready to Preorder: Get Your BCCSP Axiomatization for Free!
cites work: Extensional equivalences for transition systems
cites work: Testing equivalence as a bisimulation equivalence
cites work: Q4942026
cites work: Simulations in coalgebra
cites work: CONCUR 2003 - Concurrency Theory
cites work: A coalgebraic approach to process equivalence and a coinduction principle for traces
cites work: Trace semantics for coalgebras
cites work: Mathematical Foundations of Computer Science 2003
cites work: Behavioural differential equations: a coinductive calculus of streams, automata, and power series
cites work: Power simulation and its relation to traces and failures refinement
cites work: Q3753475
cites work: A structural approach to operational semantics
cites work: On the bisimulation proof method
cites work: Weak Bisimulation Up to Elaboration
cites work: New up-to techniques for weak bisimulation
cites work: Q4449168
cites work: Generic Forward and Backward Simulations
cites work: Generic trace theory
cites work: New Bisimulation Semantics for Distributed Systems
cites work: Ready to preorder: an algebraic and general proof
cites work: Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
DOI: 10.1016/J.IC.2007.12.003
description: scientific article; zbMATH DE number 5543803