Publication:3738540
From MaRDI portal
zbMath0602.68007MaRDI QIDQ3738540
Publication date: 1986
temporal logic; CSP; termination; concurrency; nondeterminism; program verification; CCS; Hoare-like proof rules; proving properties of programs
68Q60: Specification and verification (program logics, model checking, etc.)
68Q65: Abstract data types; algebraic specification
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68N25: Theory of operating systems
Related Items
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, Complete proof rules for strong fairness and strong extreme fairness, A fixpoint approach to finite delay and fairness, Completing the temporal picture, The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\), \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Fairness, distances and degrees, Strong fairness and ultra metrics, A compositional axiomatization of statecharts, The expressive power of indeterminate dataflow primitives, Semantic models for total correctness and fairness, Finite acceptance of infinite words, Nonexpressibility of fairness and signaling, Proving partial order properties, A compositional framework for fault tolerance by specification transformation, Safety, liveness and fairness in temporal logic, A self-stabilizing algorithm for strong fairness, Fairness and control in multi-agent systems, Semantics for finite delay, On control of systems modelled as deterministic Rabin automata, Unnamed Item
