Bisimulation on speed: a unified approach

DOI10.1016/j.tcs.2006.03.004zbMath1097.68097MaRDI QIDQ2503326

Walter Vogler, Gerald Lüttgen

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/180

zbMATH Keywords

bisimulation; asynchronous systems; time bounds; timed process algebra; amortised faster-than preorder; faster-than relation

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Lifting non-finite axiomatizability results to extensions of process algebras, New Bisimulation Semantics for Distributed Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observation equivalence as a testing equivalence
• Bisimulation on speed: Worst-case efficiency
• A theory of processes with durational actions
• Performance preorder and competitive equivalence
• On guarded recursion
• An efficiency preorder for processes
• Testing equivalences for processes
• Faster asynchronous systems.
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Process algebra with timing
• A process algebra for timed systems
• Timing and causality in process algebra
• Bisimulation on speed: Lower time bounds
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Fast asynchronous systems in dense time