scientific article; zbMATH DE number 3735115

Cited in

(71)

Communicating processes, scheduling, and the complexity of nontermination
A tableau calculus for first-order branching time logic
Méthode axiomatique sur les propriétés de fatalité des programmes parallèles
Fifty years of Hoare's logic
Hybrid diagrams
Model checking with fairness assumptions using PAT
A higher-order logic for concurrent termination-preserving refinement
CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
Fair \(\pi\)
Liminf progress measures
Automated temporal reasoning about reactive systems
Explicit fair scheduling for dynamic control
Appraising fairness in languages for distributed programming
Storage requirements for fair scheduling
Starvation-free mutual exclusion with semaphores
The \(\mu\)-calculus as an assertion-language for fairness arguments
Model checking with strong fairness
Modal logics for communicating systems
Weak and strong fairness in CCS
Merging regular processes by means of fixed-point theory
Marking fairness in Petri nets
A compositional approach to CTL\(^*\) verification
Quantitative analysis under fairness constraints
scientific article; zbMATH DE number 7559466 (Why is no real title available?)
Mutex needs fairness
A methodology for designing proof rules for fair parallel programs
Quantitatively fair scheduling
An investigation of controls for concurrent systems based on abstract control languages
Fair termination revisited - with delay
The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
Interleaving set temporal logic
Verification of distributed programs using representative interleaving sequences
On the logic of UNITY
Verification by augmented abstraction: The automata-theoretic view
On the complexity of verifying concurrent transition systems
Automatic and hierarchical verification for concurrent systems
On the limits of refinement-testing for model-checking CSP
Ensuring liveness properties of distributed systems: open problems
Verification by augmented finitary abstraction
On the verification of qualitative properties of probabilistic processes under fairness constraints.
Encoding fairness in a synchronous concurrent program algebra
Shared-memory mutual exclusion: major research trends since 1986
Global and local views of state fairness
On the complexity of verifying concurrent transition systems
Concurrent systems and inevitability
A taxonomy of fairness and temporal logic problems for Petri nets
Verification of concurrent programs: The automata-theoretic framework
Event fairness and non-interleaving concurrency
\(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
Ten years of Hoare's logic: A survey. II: Nondeterminism
A fair calculus of communicating systems
Interpretations of recursion under unbounded nondeterminacy
An introduction to the regular theory of fairness
Infinite trees, markings, and well-foundedness
Deadlock and fairness in morphisms of transition systems
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
Problems concerning fairness and temporal logic for conflict-free Petri nets
Termination of just/fair computations in term rewriting
Balanced Paths in Colored Graphs
Deductive verification of alternating systems
Fairness and conspiracies
Sémantique asynchrone et comportements infinis en CPS
Fairness and communication-based semantics for session-typed languages
A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic
A complete rule for equifair termination
Completing the temporal picture
Proving partial order properties
Strong fairness and ultra metrics
On conditions for the liveness of weakly persistent nets
On fairness and randomness
Trapping mutual exclusion in the box calculus

This page was built for publication:

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