CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897489
DOI10.1007/11539452zbMATH Open1134.68457OpenAlexW1737342522MaRDI QIDQ5897489FDOQ5897489
Authors: David de Frutos Escrig, Carlos Gregorio Rodríguez 
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11539452
Recommendations
- Towards bialgebraic semantics for the linear time -- branching time spectrum
- Branching time and orthogonal bisimulation equivalence
- Branching time and abstraction in bisimulation semantics
- A linear-time-branching-time spectrum for behavioral specification theories
- Bisimulations for temporal logic
- Unifying the linear time-branching time spectrum of process semantics
- Time-abstracted bisimulation: Implicit specifications and decidability
- scientific article; zbMATH DE number 177845
- scientific article; zbMATH DE number 1339961
- A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (9)
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
- On the unification of process semantics: equational semantics
- (Bi)simulations up-to characterise process semantics
- Ready to preorder: an algebraic and general proof
- Processes as formal power series: a coinductive approach to denotational semantics
- Simulations up-to and canonical preorders (extended abstract)
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- Branching time and orthogonal bisimulation equivalence
- New Bisimulation Semantics for Distributed Systems
This page was built for publication: CONCUR 2005 – Concurrency Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897489)
