A complete axiomatization of timed bisimulation for a class of timed regular behaviours
From MaRDI portal
DOI10.1016/0304-3975(94)00285-9zbMATH Open0872.68039OpenAlexW2043781314MaRDI QIDQ672231FDOQ672231
Authors: Luca Aceto, Alan Jeffrey
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00285-9
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Cites Work
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algebra of timed processes, ATP: Theory and application
- A process algebra for timed systems
- Real time process algebra
- Title not available (Why is that?)
- Process Algebra
- A complete inference system for a class of regular behaviours
- Title not available (Why is that?)
- A complete axiomatisation for observational congruence of finite-state behaviours
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Title not available (Why is that?)
Cited In (14)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- Time-abstracted bisimulation: Implicit specifications and decidability
- On timed alternating simulation for concurrent timed games
- Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
- Unifying behavioral equivalences of timed transition systems
- A bulk-synchronous parallel process algebra
- Bisimulation on speed: Worst-case efficiency
- Axiomatizing maximal progress and discrete time
- Title not available (Why is that?)
- Timing and causality in process algebra
- Impossibility Results for the Equational Theory of Timed CCS
- CONCUR 2005 – Concurrency Theory
- On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
- Title not available (Why is that?)
This page was built for publication: A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672231)