scientific article
From MaRDI portal
Publication:3750113
zbMath0609.68020MaRDI QIDQ3750113
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
A logic for the specification and proof of regular controllable processes of CCS, Bisimulations and abstraction homomorphisms, A domain equation for bisimulation, Deadlock and fairness in morphisms of transition systems, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, A state-based approach to communicating processes, Concurrent transition systems, Concurrency and atomicity, Combining data type and recursive process specifications using projection algebras, Algebraic specification of concurrent systems, Towards a foundation for semantics in complete metric spaces, Causal Unfoldings, A note on the characterization of weak bisimulation congruence in CCS, Fairness and regularity for SCCS processes, On the concurrent computational content of intermediate logics, Unfolding and fixpoint semantics of concurrent constraint logic programs, A complete axiomatisation for observational congruence of finite-state behaviours, Nonexpressibility of fairness and signaling
