Fast asynchronous systems in dense time

DOI10.1016/S0304-3975(99)00304-7zbMath0974.68128WikidataQ127481985 ScholiaQ127481985MaRDI QIDQ5940928

Walter Vogler, Lars Jenner

Publication date: 20 August 2001

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

zbMATH Keywords

discretizationefficiencyPetri netstestingasynchronous systems

Mathematics Subject Classification ID

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

Related Items (9)

Asynchronous Traces and Open Petri Nets ⋮ Bisimulation on speed: Lower time bounds ⋮ Performance of pipelined asynchronous systems ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Faster asynchronous systems. ⋮ Measuring the performance of asynchronous systems with PAFAS ⋮ Fairness of actions in system computations ⋮ Bisimulation on speed: a unified approach ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Refusal testing
• Performance preorder and competitive equivalence
• On describing the behavior and implementation of distributed systems
• A theory of timed automata
• An efficiency preorder for processes
• Testing equivalences for processes
• A process algebra for timed systems
• Timed testing of concurrent systems
• Forward and backward simulations. I. Untimed Systems
• Efficiency of asynchronous systems and read arcs in petri nets

This page was built for publication: Fast asynchronous systems in dense time