Comparing the worst-case efficiency of asynchronous systems with PAFAS
From MaRDI portal
Publication:1403331
DOI10.1007/s00236-002-0094-3zbMath1034.68047MaRDI 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
68Q25: Analysis of algorithms and problem complexity
Related Items
Unnamed Item, Bisimulation on speed: Lower time bounds, revTPL: The Reversible Temporal Process Language, Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions, Performance of pipelined asynchronous systems, 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, Time and Fairness in a Process Algebra with Non-blocking Reading