Measuring the performance of asynchronous systems with PAFAS
From MaRDI portal
Publication:1781997
DOI10.1016/J.TCS.2004.01.039zbMATH Open1080.68076OpenAlexW2040581864MaRDI QIDQ1781997FDOQ1781997
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of the minimum cycle mean in a digraph
- Testing equivalences for processes
- Methods and applications of (max,+) linear algebra
- Comparing the worst-case efficiency of asynchronous systems with PAFAS
- Faster asynchronous systems.
- Fast asynchronous systems in dense time
- Efficiency of Token-Passing MUTEX-Solutions β Some Experiments
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
Cited In (7)
- Performance of pipelined asynchronous systems
- Liveness of a mutex algorithm in a fair process algebra
- Comparing the worst-case efficiency of asynchronous systems with PAFAS
- Time and Fairness in a Process Algebra with Non-blocking Reading
- Formal Modeling and Analysis of Timed Systems
- High performance asynchronous design flow using a novel static performance analysis method
- Axiomatizing a fragment of PAFAS
Recommendations
This page was built for publication: Measuring the performance of asynchronous systems with PAFAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781997)