Demystifying Reachability in Vector Addition Systems
From MaRDI portal
Publication:4635791
DOI10.1109/LICS.2015.16zbMath1392.68308arXiv1503.00745MaRDI QIDQ4635791
Jérôme Leroux, Sylvain Schmitz
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00745
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Zeno, Hercules, and the Hydra, A counter abstraction technique for verifying properties of probabilistic swarm systems, Reachability problems on reliable and lossy queue automata, Petri Nets and Semilinear Sets (Extended Abstract), Context-free commutative grammars with integer counters and resets, Infinitary Noetherian constructions I. Infinite words, Handling infinitely branching well-structured transition systems, Unboundedness problems for machines with reversal-bounded counters, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Deciding Structural Liveness of Petri Nets, Open Petri nets, The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings, On the decision problem for MELL, Extensional Petri net, Directed reachability for infinite-state systems, A Note on C² Interpreted over Finite Data-Words, Verification of population protocols, On the complexity of resource-bounded logics, On Freeze LTL with Ordered Attributes, Coverability Trees for Petri Nets with Unordered Data, Shortest Paths in One-Counter Systems, Forward analysis for WSTS, part I: completions, Complexity Hierarchies beyond Elementary, Unnamed Item, Flat Petri nets (invited talk), A lazy query scheme for reachability analysis in Petri nets
