Bisimulation on speed: Lower time bounds

DOI10.1051/ita:2005030zbMath1077.68064OpenAlexW2022031828MaRDI QIDQ5313721

Gerald Lüttgen, Walter Vogler

Publication date: 1 September 2005

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_3_587_0

zbMATH Keywords

axiomatizationprecongruencefaster-than preorderMT-preorder

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Performance of pipelined asynchronous systems ⋮ Bisimulation on speed: a unified approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of processes with durational actions
• Performance preorder and competitive equivalence
• On guarded recursion
• A theory of timed automata
• An efficiency preorder for processes
• Testing equivalences for processes
• Faster asynchronous systems.
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• An operational semantics for timed CSP
• A process algebra for timed systems
• Timing and causality in process algebra
• Characteristic Formulae for Timed Automata
• Foundations of Software Science and Computation Structures
• Fast asynchronous systems in dense time

This page was built for publication: Bisimulation on speed: Lower time bounds