VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES

DOI10.1142/S0129054102000984zbMath1066.68078OpenAlexW2008973779MaRDI QIDQ3021942

Oscar H. Ibarra

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102000984

zbMATH Keywords

reachabilitysafetyblockingqueue systemreversal-bounded multicounter machine

Mathematics Subject Classification ID

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

Related Items (1)

Context-Bounded Analysis of Concurrent Queue Systems

Cites Work

• Model-checking in dense real-time
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of decision problems for finite-turn multicounter machines
• A theory of timed automata
• Symbolic model checking for real-time systems
• A technique for proving decidability of containment and equivalence of linear constraint queries
• Decidability of model checking for infinite-state concurrent systems
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• What makes some language theory problems undecidable
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• A really temporal logic

This page was built for publication: VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES