Event fairness and non-interleaving concurrency

DOI10.1007/BF01887206zbMath0696.68092OpenAlexW1986895439MaRDI QIDQ911318

Marta Kwiatkowska

Publication date: 1989

Published in: Formal Aspects of Computing (Search for Journal in Brave)

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

zbMATH Keywords

partial order semanticsconcurrency fairnessmodels for concurrencynon-interleaving semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items

Mutex needs fairness ⋮ Infinite concurrent systems. I: The relationship between metric and order convergence ⋮ On projective and separable properties ⋮ Petri nets, traces, and local model checking ⋮ Model checking with fairness assumptions using PAT ⋮ An algorithmic approach for checking closure properties of Ω-regular languages ⋮ Event fairness and non-interleaving concurrency ⋮ A metric for traces ⋮ Petri net semantics of priority systems ⋮ Verification of distributed programs using representative interleaving sequences ⋮ Combining partial-order reductions with on-the-fly model-checking. ⋮ Multitraces, hypertraces and partial order semantics ⋮ An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages ⋮ Petri nets, traces, and local model checking ⋮ Proving partial order properties

Cites Work

• Fairness and conspiracies
• Event fairness and non-interleaving concurrency
• Appraising fairness in languages for distributed programming
• Adherences of languages
• Weak and strong fairness in CCS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item