Liveness, Fairness and Impossible Futures

DOI10.1007/11817949_9zbMath1151.68560OpenAlexW1531503887MaRDI QIDQ5756606

Robert J. van Glabbeek, Marc Voorhoeve

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://unsworks.unsw.edu.au/fapi/datastream/unsworks:7781/SOURCE01?view=true

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Automatic construction of systems of distributed components from nested Petri nets models ⋮ Relating fair testing and accordance for service replaceability ⋮ A precongruence format for should testing preorder ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

This page was built for publication: Liveness, Fairness and Impossible Futures