A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Fairness
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Applications of process algebra
Applications of process algebra
Journal of the ACM (JACM)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Impossible futures and determinism
Information Processing Letters
Communication and Concurrency
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A characterisation of weak bisimulation congruence
Processes, Terms and Cycles
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Static detection of Livelocks in Ada multitasking programs
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
| Hi-index | 0.00 |
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.