Bisimulation on speed: Worst-case efficiency

DOI10.1016/j.ic.2002.08.001zbMath1074.68037OpenAlexW2062969942MaRDI QIDQ598200

Walter Vogler, Gerald Lüttgen

Publication date: 6 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2002.08.001

zbMATH Keywords

Process algebraAsynchronous systemsBisimulationFaster-than relationWorst-case timing behavior

Mathematics Subject Classification ID

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

Related Items (8)

Priority and abstraction in process algebra ⋮ Performance of pipelined asynchronous systems ⋮ Virtually timed ambients: a calculus of nested virtualization ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Fairness of components in system computations ⋮ Bisimulation on speed: a unified approach ⋮ Liveness of a mutex algorithm in a fair process algebra

Uses Software

• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• A theory of processes with durational actions
• Performance preorder and competitive equivalence
• On guarded recursion
• Calculi for synchrony and asynchrony
• A complete inference system for a class of regular behaviours
• The Esterel synchronous programming language: Design, semantics, implementation
• The timed failures -- Stability model for CSP
• A theory of timed automata
• An efficiency preorder for processes
• The algebra of timed processes, ATP: Theory and application
• Testing equivalences for processes
• Faster asynchronous systems.
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• An operational semantics for timed CSP
• A process algebra for timed systems
• Timing and causality in process algebra
• Real time process algebra
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Process Algebra
• Behavioural abstraction in TCCS
• Fast asynchronous systems in dense time
• ``Closed interval process algebra versus ``interval process algebra
• An algebraic theory of multiple clocks

This page was built for publication: Bisimulation on speed: Worst-case efficiency