Factorisation of finite state machines under strong and observational equivalences

DOI10.1007/BF01245634zbMath0738.68029OpenAlexW1972689210MaRDI QIDQ1176112

S. Singh

Publication date: 25 June 1992

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01245634

zbMATH Keywords

concurrent systemsfactorizationfinite state machinetop-down design

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

An improvement of algorithms for solving interface equations ⋮ Using logic to solve the submodule construction problem ⋮ Progressive Solutions to a Parallel Automata Equation ⋮ Progressive solutions to a parallel automata equation ⋮ Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution

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

This page was built for publication: Factorisation of finite state machines under strong and observational equivalences