Testing for unboundedness of Fifo channels

DOI10.1007/BFB0020809MaRDI QIDQ4035681zbMATH OpenFDO

Authors Thierry Jéron

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

communicating finite state machinesFifo-netsspecification modelsunboundedness problem

Mathematics Subject Classification ID

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

Recommendations

• Testing for unboundedness of fifo channels
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• scientific article; zbMATH DE number 3907779
• Unidirectional channel systems can be tested
• Boundedness, empty channel detection, and synchronization for communicating finite automata

Cited in

(5)

• Regularity results for FIFO channels
• scientific article; zbMATH DE number 5711524 (Why is no real title available?)
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• Bounded-memory algorithms for verification on-the-fly
• Testing for unboundedness of fifo channels

This page was built for publication: Testing for unboundedness of Fifo channels

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