scientific article; zbMATH DE number 3972158
From MaRDI portal
Publication:3738540
zbMATH Open0602.68007MaRDI QIDQ3738540FDOQ3738540
Authors: Nissim Francez 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
CSPconcurrencynondeterminismtemporal logicprogram verificationterminationCCSHoare-like proof rulesproving properties of programs
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)
Cited In (94)
- Title not available (Why is that?)
- An Algebraic Approach to Refinement with Fair Choice
- A complete rule for equifair termination
- Probabilistic termination versus fair termination
- Complete proof rules for strong fairness and strong extreme fairness
- Title not available (Why is that?)
- Fairness, distances and degrees
- Strong fairness and ultra metrics
- A process algebraic view of input/output automata
- Alternating-time stream logic for multi-agent systems
- An introduction to the regular theory of fairness
- Deadlock and fairness in morphisms of transition systems
- Symmetry breaking in distributed networks
- Finite acceptance of infinite words
- Infinite trees, markings, and well-foundedness
- Duality and the completeness of the modal \(\mu\)-calculus
- Quantitative analysis under fairness constraints
- Mutex needs fairness
- Fairness in context-free grammars under every choice-strategy
- On conditions for the liveness of weakly persistent nets
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm
- Verification of concurrent programs: The automata-theoretic framework
- Fairness and partial order semantics
- On the border of causality: contact and confusion
- A compositional framework for fault tolerance by specification transformation
- Fairness and conspiracies
- Semantics for finite delay
- Divergence and fair testing
- The semantics of priority and fairness in occam
- Interleaving set temporal logic
- On control of systems modelled as deterministic Rabin automata
- On proving properties of completion strategies
- Soundness and completeness proofs by coinductive methods
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Fairness and hyperfairness
- Proving partial order properties
- Starvation-free mutual exclusion with semaphores
- Fairness and communication-based semantics for session-typed languages
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- A taxonomy of fairness and temporal logic problems for Petri nets
- Quantitatively fair scheduling
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- Title not available (Why is that?)
- On verifying that a concurrent program satisfies a nondeterministic specification
- Completing the temporal picture
- On Stubborn Sets in the Verification of Linear Time Temporal Properties
- The expressive power of indeterminate dataflow primitives
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
- A compositional axiomatization of statecharts
- A Temporal Logic of Normative Systems
- Nonexpressibility of fairness and signaling
- Title not available (Why is that?)
- A fixpoint approach to finite delay and fairness
- Semantic models for total correctness and fairness
- Semantic models for total correctness and fairness
- Applications and Theory of Petri Nets 2004
- Termination of just/fair computations in term rewriting
- Safety, liveness and fairness in temporal logic
- Title not available (Why is that?)
- Computable concurrent processes
- On the logic of UNITY
- Inference of ranking functions for proving temporal properties by abstract interpretation
- A self-stabilizing algorithm for strong fairness
- Strong fairness and full abstraction for communicating processes
- A decision-theoretic approach to reliable message delivery
- Automated temporal reasoning about reactive systems
- Fair termination of multiparty sessions
- Fairness and control in multi-agent systems
- An optimal self-stabilizing strarvation-free alternator
- Automata, Languages and Programming
- Fast and succinct population protocols for Presburger arithmetic
- Positive Dedalus programs tolerate non-causality
- 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
- On-the-fly emptiness check of transition-based Streett automata
- Keep it fair: equivalence and composition
- Fairness and regularity for SCCS processes
- Liminf progress measures
- Putting logic-based distributed systems on stable grounds
- Modelling mutual exclusion in a process algebra with time-outs
- Using counterfactuals in knowledge-based programming
- Fair \(\pi\)
- A logical account of subtyping for session types
- Title not available (Why is that?)
- Generalisations of disjunctive sequences
- Title not available (Why is that?)
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- Probabilistic total store ordering
- Title not available (Why is that?)
- Model checking with fairness assumptions using PAT
- Fast symbolic algorithms for omega-regular games under strong transition fairness
- Fair decisions
- A category-theoretic semantics for unbounded indeterminacy
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 Q3738540)
