Integer Vector Addition Systems with States
From MaRDI portal
Publication:3447699
DOI10.1007/978-3-319-11439-2_9zbMath1393.68115arXiv1406.2590OpenAlexW3100550693MaRDI QIDQ3447699
Publication date: 28 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.2590
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (17)
Algebraic program analysis ⋮ Context-free commutative grammars with integer counters and resets ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Recent advances on reachability problems for valence systems (invited talk) ⋮ Purely Catalytic P Systems over Integers and Their Generative Power ⋮ Automata for unordered trees ⋮ On decidability and complexity of low-dimensional robot games ⋮ On Robot Games of Degree Two ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ On Affine Reachability Problems ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Taming past LTL and flat counter systems
This page was built for publication: Integer Vector Addition Systems with States
