Constructing submodule specifications and network protocols

DOI10.1109/32.9045zbMath0671.68029OpenAlexW2056800297WikidataQ56968336 ScholiaQ56968336MaRDI QIDQ3823806

Juan Aristizabal, Deepinder P. Sidhu

Publication date: 1988

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/32.9045

zbMATH Keywords

deterministic finite-state automatonprotocol verificationtransition net specification

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of software (68N99)

Related Items (2)

An improvement of algorithms for solving interface equations ⋮ Factorisation of finite state machines under strong and observational equivalences

This page was built for publication: Constructing submodule specifications and network protocols