Testing for unboundedness of fifo channels
From MaRDI portal
Publication:685434
DOI10.1016/0304-3975(93)90212-CzbMath0781.68085MaRDI QIDQ685434
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Well-abstracted transition systems: Application to FIFO automata., Automated verification of automata communicating via FIFO and bag buffers, Quasi-static scheduling of communicating tasks, Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, Verification of programs with half-duplex communication
Cites Work