scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

temporal logic CSP termination concurrency nondeterminism program verification CCS Hoare-like proof rules proving properties of programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25)

Related Items

A compositional framework for fault tolerance by specification transformation, Soundness and completeness proofs by coinductive methods, The semantics of priority and fairness in occam, A category-theoretic semantics for unbounded indeterminacy, Mutex needs fairness, Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types, A complete rule for equifair termination, Safety, liveness and fairness in temporal logic, On proving properties of completion strategies, Interleaving set temporal logic, An introduction to the regular theory of fairness, On control of systems modelled as deterministic Rabin automata, Deadlock and fairness in morphisms of transition systems, Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm, Infinite trees, markings, and well-foundedness, Fairness in context-free grammars under every choice-strategy, On verifying that a concurrent program satisfies a nondeterministic specification, A fixpoint approach to finite delay and fairness, A self-stabilizing algorithm for strong fairness, Fairness and communication-based semantics for session-typed languages, Fairness and control in multi-agent systems, Semantics for finite delay, Model checking with fairness assumptions using PAT, Modelling mutual exclusion in a process algebra with time-outs, Putting logic-based distributed systems on stable grounds, Keep it fair: equivalence and composition, Fast and succinct population protocols for Presburger arithmetic, Probabilistic total store ordering, Liminf progress measures, Unnamed Item, Symmetry breaking in distributed networks, Unnamed Item, Unnamed Item, Termination of just/fair computations in term rewriting, Starvation-free mutual exclusion with semaphores, Fairness and hyperfairness, A decision-theoretic approach to reliable message delivery, Using counterfactuals in knowledge-based programming, Unnamed Item, Positive Dedalus programs tolerate non-causality, Completing the temporal picture, Fair Termination for Parameterized Probabilistic Concurrent Systems, Fairness and regularity for SCCS processes, Duality and the completeness of the modal \(\mu\)-calculus, Fairness and partial order semantics, On the border of causality: contact and confusion, On the logic of UNITY, Computable concurrent processes, A process algebraic view of input/output automata, Semantic models for total correctness and fairness, The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\), An Algebraic Approach to Refinement with Fair Choice, \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Divergence and fair testing, Fairness, distances and degrees, Strong fairness and ultra metrics, A compositional axiomatization of statecharts, Inference of ranking functions for proving temporal properties by abstract interpretation, Complete proof rules for strong fairness and strong extreme fairness, The expressive power of indeterminate dataflow primitives, Semantic models for total correctness and fairness, Alternating-time stream logic for multi-agent systems, Generalisations of disjunctive sequences, A Temporal Logic of Normative Systems, Verification of concurrent programs: The automata-theoretic framework, On conditions for the liveness of weakly persistent nets, Fifty years of Hoare's logic, Finite acceptance of infinite words, Probabilistic termination versus fair termination, Quantitatively fair scheduling, Quantitative Analysis under Fairness Constraints, On-the-fly Emptiness Check of Transition-Based Streett Automata, An optimal self-stabilizing strarvation-free alternator, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Strong fairness and full abstraction for communicating processes, Nonexpressibility of fairness and signaling, On the verification of qualitative properties of probabilistic processes under fairness constraints., Fair Π, A taxonomy of fairness and temporal logic problems for Petri nets, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, Proving partial order properties