Reachability and safety in queue systems

DOI10.1007/3-540-44674-5_12MaRDI QIDQ4540964zbMATH OpenFDO

Authors Oscar H. Ibarra

Publication date 28 July 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2088/20880145

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Formal languages and automata (68Q45)

Recommendations

• VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
• On reachability and safety in infinite-state systems
• Reachability analysis for some models of infinite-state transition systems
• Context-Bounded Analysis of Concurrent Queue Systems
• Reachability problems on reliable and lossy queue automata

Cited in

(7)

• Verification in loosely synchronous queue-connected discrete timed automata.
• Reachability problems on partially lossy queue automata
• VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
• Reachability analysis for some models of infinite-state transition systems
• On reachability and safety in infinite-state systems
• Context-Bounded Analysis of Concurrent Queue Systems
• Reachability problems on reliable and lossy queue automata

This page was built for publication: Reachability and safety in queue systems

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