Bisimulation on speed: Worst-case efficiency

DOI10.1016/J.IC.2002.08.001zbMATH Open1074.68037OpenAlexW2062969942MaRDI QIDQ598200FDOQ598200

Authors Gerald Lüttgen, Walter Vogler

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)

Recommendations

• scientific article; zbMATH DE number 1863169
• Bisimulation on speed: Lower time bounds
• Bisimulation and divergence
• Foundations of Software Science and Computation Structures
• Bisimulation on speed: a unified approach

Cites work

• scientific article; zbMATH DE number 1670867 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176736 (Why is no real title available?)
• scientific article; zbMATH DE number 1304995 (Why is no real title available?)
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• A complete inference system for a class of regular behaviours
• A process algebra for timed systems
• A theory of processes with durational actions
• A theory of timed automata
• An algebraic theory of multiple clocks
• An efficiency preorder for processes
• An operational semantics for timed CSP
• Axiomatizing a fragment of PAFAS
• Behavioural abstraction in TCCS
• Calculi for synchrony and asynchrony
• Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Fast asynchronous systems in dense time
• Faster asynchronous systems.
• Handbook of process algebra
• On guarded recursion
• Performance preorder and competitive equivalence
• Process Algebra
• Process algebra with timing: Real time and discrete time
• Real time process algebra
• Structural operational semantics.
• Testing equivalences for processes
• The Esterel synchronous programming language: Design, semantics, implementation
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• The algebra of timed processes, ATP: Theory and application
• The timed failures -- Stability model for CSP
• Timing and causality in process algebra
• ``Closed interval process algebra versus ``interval process algebra

Cited in

(11)

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

Describes a project that uses

Uses Software

• Esterel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598200)