Proving Liveness and Termination of Systolic Arrays Using Communicating Finite State Machines

DOI10.1109/TSE.1985.231871MaRDI QIDQ3690225zbMATH OpenFDO

Authors Huiseng Lee, Mohamed G. Gouda

Publication date 1985

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

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

zbMATH Keywords

FIFO channels

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Proving liveness for networks of communicating finite state machines
• scientific article; zbMATH DE number 4043216
• scientific article; zbMATH DE number 4128366
• A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems
• Verification of finite-state machines: a distributed approach
• scientific article; zbMATH DE number 177525
• Direct formal verification of liveness properties in continuous and hybrid dynamical systems
• scientific article; zbMATH DE number 1324660

Cited in

(2)

• Verification of a class of self-timed computational networks
• Proving liveness for networks of communicating finite state machines

This page was built for publication: Proving Liveness and Termination of Systolic Arrays Using Communicating Finite State Machines

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