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