Liveness, fairness and impossible futures van Glabbeek, Robert en_US Voorhoeve, M en_US 2021-11-25T15:26:21Z 2021-11-25T15:26:21Z 2006 en_US
dc.description.abstract 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. en_US
dc.identifier.isbn 9783540373766 en_US
dc.language English
dc.language.iso EN en_US
dc.publisher Springer-Verlag Berlin en_US
dc.rights CC BY-NC-ND 3.0 en_US
dc.rights.uri en_US
dc.source Legacy MARC en_US
dc.title Liveness, fairness and impossible futures en_US
dc.type Conference Paper en
dcterms.accessRights open access
dspace.entity.type Publication en_US
unsw.description.publisherStatement The original publication is available at en_US
unsw.identifier.doiPublisher en_US Berlin en_US
unsw.relation.faculty Engineering
unsw.relation.ispartofconferenceLocation Bonn, Germany en_US
unsw.relation.ispartofconferenceName 17th international conference on Concurrency theory---CONCUR 2006 en_US
unsw.relation.ispartofconferenceProceedingsTitle Concurrency theory---CONCUR 2006 en_US
unsw.relation.ispartofconferenceYear 2006 en_US
unsw.relation.ispartofpagefrompageto 126-141 en_US
unsw.relation.originalPublicationAffiliation van Glabbeek, Robert, Computer Science & Engineering, Faculty of Engineering, UNSW en_US
unsw.relation.originalPublicationAffiliation Voorhoeve, M en_US School of Computer Science and Engineering *
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
207.79 KB
Resource type