A refinement calculus for specifications in Hennessy-Milner logic with recursion
From MaRDI portal
Publication:911261
DOI10.1007/BF01887208zbMath0696.68037MaRDI QIDQ911261
Publication date: 1989
Published in: Formal Aspects of Computing (Search for Journal in Brave)
refinement; concurrency; specification language; CCS; Hennessy-Milner Logic; specification and verification of processes
03B45: Modal logic (including the logic of norms)
68Q60: Specification and verification (program logics, model checking, etc.)
68N25: Theory of operating systems
68N99: Theory of software
Related Items
Conjunction on processes: Full abstraction via ready-tree semantics, A functional programming approach to the specification and verification of concurrent systems, Local model checking in the modal mu-calculus
Cites Work
- Calculi for synchrony and asynchrony
- A proof-theoretic characterization of observational equivalence
- A calculus of communicating systems
- A lattice-theoretical fixpoint theorem and its applications
- Algebraic laws for nondeterminism and concurrency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item