The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Logically defined subsets of Nk
Theoretical Computer Science
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
The Succinctness of First-Order Logic on Linear Orders
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Reachability Problems on Regular Ground Tree Rewriting Graphs
Theory of Computing Systems
Theory of Computation (Texts in Computer Science)
Theory of Computation (Texts in Computer Science)
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
On the Computational Complexity of Verifying One-Counter Processes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Branching-Time model checking of parametric one-counter automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products of one-counter processes against 1) first-order logic FO(R) with reachability predicate, 2) the finite variable fragments FOk(R) (k ≥ 2) of FO(R), 3) EF-logic which is a fragment of FO2(R), and 4) all these logics extended with simple component-wise synchronizing predicates. We give a rather complete picture of their combined, expression, and data complexity. To this end, we show that these problems are poly-time reducible to two syntactic restrictions of Presburger Arithmetic, which are equi-expressive with first-order modulo counting theory of (N,