scientific article; zbMATH DE number 177520

MaRDI QIDQ4037389zbMATH OpenFDO

Authors Wuxu Peng, Sudarshan P. Purushothaman

Publication date 18 May 1993

zbMATH Keywords

communicating finite state machinesspecifying, verifying and synthesizing communication protocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 177258
• scientific article; zbMATH DE number 3881887
• scientific article; zbMATH DE number 4043216
• Analysis of a class of communicating finite state machines
• scientific article; zbMATH DE number 3926230

Cited in

(6)

• Analysis of a class of communicating finite state machines
• On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels
• Deadlock analysis in networks of communicating processes
• scientific article; zbMATH DE number 4043216 (Why is no real title available?)
• scientific article; zbMATH DE number 177258 (Why is no real title available?)
• On the undecidability of deadlock detection in families of nets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037389)