Comparing the worst-case efficiency of asynchronous systems with PAFAS
From MaRDI portal
Recommendations
Cited in
(20)- Liveness of a mutex algorithm in a fair process algebra
- Faster asynchronous systems.
- Measuring the performance of asynchronous systems with PAFAS
- Composition methods for constructing characteristic formulas for dense-time models
- Testing equivalences of time Petri nets
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Fairness of components in system computations
- Fairness of actions in system computations
- Axiomatizing a fragment of PAFAS
- Efficiency of asynchronous systems that communicate asynchronously
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
- Time and Fairness in a Process Algebra with Non-blocking Reading
- scientific article; zbMATH DE number 2102738 (Why is no real title available?)
- Analysing mutual exclusion using process algebra with signals
- Bisimulation on speed: Lower time bounds
- Fast asynchronous systems in dense time
- revTPL: The Reversible Temporal Process Language
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Causal reversibility in nondeterministic process calculi extended with time or probabilities
- Performance of pipelined asynchronous systems
This page was built for publication: Comparing the worst-case efficiency of asynchronous systems with PAFAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403331)
