Testing for unboundedness of fifo channels

DOI10.1016/0304-3975(93)90212-CzbMath0781.68085MaRDI QIDQ685434

Claude Jard, Thierry Jéron

Publication date: 17 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilityunboundednessEstelle specificationsfifo channels

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Automated verification of automata communicating via FIFO and bag buffers ⋮ Branch-well-structured transition systems and extensions ⋮ Well-abstracted transition systems: Application to FIFO automata. ⋮ Quasi-static scheduling of communicating tasks ⋮ Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations ⋮ Unnamed Item ⋮ Verification of Flat FIFO Systems ⋮ Non axiomatisability of positive relation algebras with constants, via graph homomorphisms ⋮ Unnamed Item ⋮ Verification of programs with half-duplex communication

Cites Work

• Boundedness, empty channel detection, and synchronization for communicating finite automata
• Homomorphisms between models of parallel computation
• Parallel program schemata
• On Communicating Finite-State Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item