@inproceedings{0cb22aa826d14517a706a0be5106c8c1,
title = "Liveness, fairness and impossible futures",
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.",
author = "{Glabbeek, van}, R.J. and M. Voorhoeve",
year = "2006",
doi = "10.1007/11817949_9",
language = "English",
isbn = "3-540-37378-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "126--141",
editor = "C. Baier and H. Hermanns",
booktitle = "CONCUR 2006 - Concurrency Theory (Proceedings 17th International Conference, Bonn, Germany, August 27-30, 2006)",
address = "Germany",
}