Measuring the performance of asynchronous systems with PAFAS

DOI10.1016/J.TCS.2004.01.039zbMath1080.68076OpenAlexW2040581864MaRDI QIDQ1781997

Flavio Corradini, Walter Vogler

Publication date: 10 June 2005

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

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/197

zbMATH Keywords

Process algebraEfficiencyConcurrent systemsTimed testing

Mathematics Subject Classification ID

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

Related Items (3)

Performance of pipelined asynchronous systems ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ Liveness of a mutex algorithm in a fair process algebra

Cites Work

• A characterization of the minimum cycle mean in a digraph
• Testing equivalences for processes
• Faster asynchronous systems.
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Methods and applications of (max,+) linear algebra
• Foundations of Software Science and Computation Structures
• Fast asynchronous systems in dense time
• Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Measuring the performance of asynchronous systems with PAFAS