Comparing the worst-case efficiency of asynchronous systems with PAFAS

DOI10.1007/S00236-002-0094-3zbMath1034.68047OpenAlexW1973451698MaRDI QIDQ1403331

Lars Jenner, Walter Vogler, Flavio Corradini

Publication date: 1 September 2003

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/206/TB_2000_06.pdf

zbMATH Keywords

timed CCS-like process algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (14)

Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Bisimulation on speed: Lower time bounds ⋮ Performance of pipelined asynchronous systems ⋮ Composition methods for constructing characteristic formulas for dense-time models ⋮ Faster asynchronous systems. ⋮ revTPL: The Reversible Temporal Process Language ⋮ Unnamed Item ⋮ Testing equivalences of time Petri nets ⋮ Fairness of components in system computations ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ Measuring the performance of asynchronous systems with PAFAS ⋮ Fairness of actions in system computations ⋮ Liveness of a mutex algorithm in a fair process algebra ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

This page was built for publication: Comparing the worst-case efficiency of asynchronous systems with PAFAS