Faster asynchronous systems.

DOI10.1016/S0890-5401(03)00065-8MaRDI QIDQ1401952zbMATH OpenFDO

Authors Walter Vogler

Publication date 19 August 2003

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

Full work available at URL https://doi.org/10.1016/S0890-5401(03)00065-8

zbMATH Keywords

Asynchronous systemsPetri netsTesting theoryWorst-case performance

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 2102738
• Fast asynchronous systems in dense time
• A Fresh Look at Testing for Asynchronous Communication
• scientific article; zbMATH DE number 1696468
• Comparing the worst-case efficiency of asynchronous systems with PAFAS

Cites work

• A brief history of Timed CSP
• A process algebra for timed systems
• An efficiency preorder for processes
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
• Extensional equivalences for transition systems
• Fast asynchronous systems in dense time
• Forward and backward simulations. I. Untimed Systems
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4050970 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1995152 (Why is no real title available?)
• Modular construction and partial order semantics of Petri nets
• On describing the behavior and implementation of distributed systems
• Performance preorder and competitive equivalence
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Testing equivalences for processes
• Timed testing of concurrent systems

Cited in

(14)

• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Measuring the performance of asynchronous systems with PAFAS
• Bisimulation on speed: a unified approach
• scientific article; zbMATH DE number 1696468 (Why is no real title available?)
• A Fresh Look at Testing for Asynchronous Communication
• scientific article; zbMATH DE number 1863169 (Why is no real title available?)
• scientific article; zbMATH DE number 2102738 (Why is no real title available?)
• scientific article; zbMATH DE number 1418463 (Why is no real title available?)
• Bisimulation on speed: Lower time bounds
• Fast asynchronous systems in dense time
• Bisimulation on speed: Worst-case efficiency
• Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
• A faster-than relation for semi-Markov decision processes
• Performance of pipelined asynchronous systems

This page was built for publication: Faster asynchronous systems.

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