Liveness, Fairness and Impossible Futures

Rob van Glabbeek, Marc Voorhoeve

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same ``AGEF'' properties: temporal logic properties saying that reaching a desired outcome is not doomed to fail. We show that this equivalence, with an added root condition, is the coarsest congruence containing weak bisimilarity with explicit divergence that respects deadlock/livelock traces (or fair testing, or any liveness property under a global fairness assumption) and assigns unique solutions to recursive equations.
Original languageEnglish
Title of host publicationCONCUR 2006 -- Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006
EditorsChristel Baier, Holger Hermanns
Place of PublicationHeidelberg
PublisherSpringer
Pages126-141
Number of pages16
ISBN (Electronic)978-3-540-37377-3
ISBN (Print)978-3-540-37376-6
DOIs
Publication statusPublished - 30 Aug 2006
EventThe 17th International Conference on Concurrency Theory, 2006 - Bonn, Germany
Duration: 27 Aug 200630 Aug 2006
Conference number: 17
https://depend.cs.uni-saarland.de/index.php?id=377

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
Volume4137
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceThe 17th International Conference on Concurrency Theory, 2006
Abbreviated titleCONCUR 2006
Country/TerritoryGermany
CityBonn
Period27/08/0630/08/06
Internet address

Fingerprint

Dive into the research topics of 'Liveness, Fairness and Impossible Futures'. Together they form a unique fingerprint.

Cite this