Measuring the performance of asynchronous systems with PAFAS
From MaRDI portal
Publication:1781997
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1863169 (Why is no real title available?)
- A characterization of the minimum cycle mean in a digraph
- Comparing the worst-case efficiency of asynchronous systems with PAFAS
- Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
- Fast asynchronous systems in dense time
- Faster asynchronous systems.
- Foundations of Software Science and Computation Structures
- Methods and applications of \((\max,+)\) linear algebra
- Testing equivalences for processes
Cited in
(7)- High performance asynchronous design flow using a novel static performance analysis method
- Formal Modeling and Analysis of Timed Systems
- Time and Fairness in a Process Algebra with Non-blocking Reading
- 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
- Axiomatizing a fragment of PAFAS
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)