Integer reachability is NP-complete for vector addition systems with states (VASS), but becomes PSPACE-complete in the presence of transfer operations. We refine this complexity gap for single-transfer VASS by identifying structural features of transfers responsible for the increase in complexity. Each system induces a...
This work studies the unambiguous complexity of the Long Path problem on DAGs under parameterization and obtains an algorithm that achieves unambiguous and co-unambiguous O ( k log n ) space while running in time polynomial in both n and k.
Ronak Bhadra, Saurya Singh, Raghunath Tewari· International Symposium on M...· 0 citations
We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is $\Pi^1_\infty$-complete, and, more strongly, computably isomorphic to true second-order arithmetic. The lower bound is established for the next-time Boolean-goal fragment of Strategy Logic. Consequently, Strategy Log...
In this paper, we propose a novel quantum solution to address the problem of reachability in bounded quantum Petri nets (QPNs), an advanced modeling framework that combines the classical Petri net model with quantum mechanical principles. The proposed approach exploits quantum parallelism to construct a superposition o...
We introduce spatio-temporal polyhedral reachability logics, extending dynamic topological logic with polyhedral semantics and a path-based spatial reachability operator. Formulas are interpreted over polyhedra, with admissible valuations ranging over polyhedral subsets; the spatial modality is interpreted as interior,...
Nick Bezhanishvili, Laura Bussi, Vincenzo Ciancia et al.· 0 citations
A new class of automata running on infinite trees of arbitrary arity is introduced, and several algorithms to perform classical operations are developed for those automata and precisely characterise their complexities.
François Laroussinie, Nicolas Markey· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
