The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimal solutions of linear diophantine systems: bounds and algorithms
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Reasoning about infinite computations
Information and Computation
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The stuttering principle revisited
Acta Informatica
Computation: finite and infinite machines
Computation: finite and infinite machines
Information Processing Letters
Weak Kripke structures and LTL
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Fast acceleration of ultimately periodic relations
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Among the approximation methods for the verification of counter systems, one of them consists in model-checking their flat unfoldings. Unfortunately, the complexity characterization of model-checking problems for such operational models is not always well studied except for reachability queries or for Past LTL. In this paper, we characterize the complexity of model-checking problems on flat counter systems for the specification languages including first-order logic, linear mu-calculus, infinite automata, and related formalisms. Our results span different complexity classes (mainly from PTime to PSpace) and they apply to languages in which arithmetical constraints on counter values are systematically allowed. As far as the proof techniques are concerned, we provide a uniform approach that focuses on the main issues.