Fair equivalence relations

DOI10.1007/3-540-44450-5_12MaRDI QIDQ4472441zbMATH OpenFDO

Authors Orna Kupferman, Nir Piterman, Moshe Y. Vardi

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740151.htm

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)

Recommendations

• Fair equivalence relations
• Keep it fair: equivalences
• On equivalence-completions of fairness assumptions
• Keep it fair: equivalence and composition
• Equivalences for fair Kripke structures
• A characterization of egalitarian equivalence
• Fairness under composition
• Relative exchangeability with equivalence relations

Cited in

(5)

• Fairness, distances and degrees
• Bridging the gap between fair simulation and trace inclusion
• Fair bisimulation
• Fair equivalence relations
• Fair simulation

This page was built for publication: Fair equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472441)