Bisimulation on speed: a unified approach

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

Gerald Lüttgen, Walter Vogler

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

bisimulationasynchronous systemstime boundstimed process algebraamortised faster-than preorderfaster-than relation

Mathematics Subject Classification ID

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

Related Items (3)

Integrating deployment architectures and resource consumption in timed object-oriented models ⋮ 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

This page was built for publication: Bisimulation on speed: a unified approach