Defining Fairness in Reactive and Concurrent Systems

DOI10.1145/2220357.2220360zbMath1281.68163OpenAlexW1998389127MaRDI QIDQ5395684

Daniele Varacca, Hagen Völzer

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2220357.2220360

zbMATH Keywords

fairnessgame theoryconcurrent systemstopologymodel checkingtemporal logictemporal propertiesmachine closure

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (5)

Baire Category Quantifier in Monadic Second Order Logic ⋮ Two Effective Properties of ω-Rational Functions ⋮ Counting branches in trees using games ⋮ Monadic Second Order Logic with Measure and Category Quantifiers ⋮ Symmetry in domination for hypergraphs with choice

This page was built for publication: Defining Fairness in Reactive and Concurrent Systems