Faster asynchronous systems.

DOI10.1016/S0890-5401(03)00065-8zbMath1054.68097MaRDI QIDQ1401952

Walter Vogler

Publication date: 19 August 2003

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

zbMATH Keywords

Petri netsAsynchronous systemsWorst-case performanceTesting theory

Mathematics Subject Classification ID

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

Related Items (5)

Bisimulation on speed: Lower time bounds ⋮ Performance of pipelined asynchronous systems ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Measuring the performance of asynchronous systems with PAFAS ⋮ Bisimulation on speed: a unified approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• A brief history of Timed CSP
• Performance preorder and competitive equivalence
• Extensional equivalences for transition systems
• On describing the behavior and implementation of distributed systems
• An efficiency preorder for processes
• Testing equivalences for processes
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• A process algebra for timed systems
• Timed testing of concurrent systems
• Forward and backward simulations. I. Untimed Systems
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Fast asynchronous systems in dense time

This page was built for publication: Faster asynchronous systems.