Factorisation of finite state machines under strong and observational equivalences
type: Item
instance of: scholarly article
title: Factorisation of finite state machines under strong and observational equivalences
zbMATH Open document ID: 0738.68029
DOI: 10.1007/BF01245634
author: S. Singh
published in: Formal Aspects of Computing
publication date: 1992-06-25T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 13469
zbMATH Keywords: factorization
zbMATH Keywords: concurrent systems
zbMATH Keywords: top-down design
zbMATH Keywords: finite state machine
MaRDI profile type: Publication
cites work: The synthesis of communication protocols
cites work: A context dependent equivalence between processes
cites work: On the Construction of Submodule Specifications and Communication Protocols
cites work: A calculus of communicating systems
cites work: Synthesis of Communicating Processes from Temporal Logic Specifications
cites work: Q3907077
cites work: Submodule construction as equation solving in CCS
cites work: Constructing submodule specifications and network protocols
full work available at URL: https://doi.org/10.1007/bf01245634
OpenAlex ID: W1972689210
description: scientific article; zbMATH DE number 13469