Performance preorder and competitive equivalence

DOI10.1007/S002360050107zbMath0878.68081OpenAlexW2010241460MaRDI QIDQ678252

Flavio Corradini, Roberto Gorrieri, Marco Roccetti

Publication date: 11 September 1997

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

Full work available at URL: https://doi.org/10.1007/s002360050107

zbMATH Keywords

stepwise refinementparallelismimplementationconcurrencyspecificationaxiomatizations for finite agentscompetitive equivalenceinduced equivalenceperformance preorderprocess algebra with durational actionssemantics for process description languagesstrong bisimulation equivalence

Mathematics Subject Classification ID

Partial orders, general (06A06) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Bisimulation on speed: Lower time bounds ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Faster asynchronous systems. ⋮ Undecidability of performance equivalence of Petri nets ⋮ Fast asynchronous systems in dense time ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Bisimulation on speed: a unified approach ⋮ On the semantics of durational actions ⋮ On performance congruences for process algebras

This page was built for publication: Performance preorder and competitive equivalence