Fairness and related properties in transition systems - a temporal logic to deal with fairness

From MaRDI portal
Publication:1166926

DOI10.1007/BF00265555zbMath0489.68024OpenAlexW2126395320MaRDI QIDQ1166926

J. P. Queille, Joseph Sifakis

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00265555




Related Items

Verification of \(\mathrm{EB}^3\) specifications using CADPModel checking and abstraction to the aid of parameterized systems (a survey)On proving properties of completion strategiesGenerating non-conspiratorial executionsAn introduction to the regular theory of fairnessModel checking a cache coherence protocol of a Java DSM implementationProblems concerning fairness and temporal logic for conflict-free Petri netsModel checking with fairness assumptions using PATOn feasible cases of checking multi-agent systems behavior.The Birth of Model CheckingFairness and hyperfairnessFairness and regularity for SCCS processesCompilation of the ELECTRE reactive language into finite transition systemsArity hierarchy for temporal logicsStrong fairness and ultra metrics\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)Modal logics for communicating systemsVerification of concurrent programs: The automata-theoretic frameworkAn algebraic and algorithmic method for analysing transition systemsWeak and strong fairness in CCSTen years of Hoare's logic: A survey. II: NondeterminismOn the verification of qualitative properties of probabilistic processes under fairness constraints.Fair ΠGlobal and local views of state fairnessA taxonomy of fairness and temporal logic problems for Petri netsCompositional verification of asynchronous concurrent systems using CADP


Uses Software