Factorisation of finite state machines under strong and observational equivalences
From MaRDI portal
Publication:1176112
DOI10.1007/BF01245634zbMath0738.68029MaRDI QIDQ1176112
Publication date: 25 June 1992
Published in: Formal Aspects of Computing (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q60: Specification and verification (program logics, model checking, etc.)
Cites Work
- Unnamed Item
- A context dependent equivalence between processes
- The synthesis of communication protocols
- A calculus of communicating systems
- Submodule construction as equation solving in CCS
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Constructing submodule specifications and network protocols
- On the Construction of Submodule Specifications and Communication Protocols