An analysis of the non-emptiness problem for classes of reversal-bounded multicounter machines
Journal of Computer and System Sciences
Reasoning about infinite computations
Information and Computation
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Verification Decidability of Presburger Array Programs
Journal of the ACM (JACM)
On the complexity of integer programming
Journal of the ACM (JACM)
Counter machines and verification Problems
Theoretical Computer Science
The Complexity of Decision Problems for Finite-Turn Multicounter Machines
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
On the Complexity of the Linear-Time mu -calculus for Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
TaPAS: The Talence Presburger Arithmetic Suite
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
CAV'07 Proceedings of the 19th international conference on Computer aided verification
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Parikh Images of Grammars: Complexity and Applications
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Bounded Reachability for Temporal Logic over Constraint Systems
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Context-Bounded model checking of concurrent software
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We study model-checking problems on counter systems when guards are quantifier-free Presburger formulae, the specification languages are LTL-like dialects with arithmetical constraints and the runs are restricted to reversal-bounded ones. We introduce a generalization of reversal-boundedness and we show the NExpTime-completeness of the reversal-bounded model-checking problem as well as for related reversal-bounded reachability problems. As a by-product, we show the effective Presburger definability for sets of configurations for which there is a reversal-bounded run verifying a given temporal formula. Our results generalize existing results about reversal-bounded counter automata and provides a uniform and more general framework.