scientific article; zbMATH DE number 7559494

DOI10.4230/LIPICS.CONCUR.2020.38MaRDI QIDQ5089305zbMATH OpenFDO

Authors Shaull Almagor, Nathann Cohen, G. A. Pérez, Mahsa Shirmohammadi, James Worrell

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1902.06576

zbMATH Keywords

reachabilityvector addition systems with statesweighted graphs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A multiparameter analysis of the boundedness problem for vector addition systems
• Computational Complexity
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Model checking memoryful linear-time logics over one-counter automata
• Model checking succinct and parametric one-counter automata
• New Parallel-Sorting Schemes
• On parametric timed automata and one-counter machines
• Reachability in register machines with polynomial updates
• Reachability in Succinct and Parametric One-Counter Automata
• Reachability in two-clock timed automata is PSPACE-complete
• The complexity of flat freeze LTL
• The covering and boundedness problems for vector addition systems
• The exact path length problem.
• The reachability problem for Petri nets is not elementary

Cited in

(7)

• Strategic reasoning with a bounded number of resources: the quest for tractability
• scientific article; zbMATH DE number 7559503 (Why is no real title available?)
• Coverability in 2-VASS with one unary counter is in NP
• Invariants for one-counter automata with disequality tests
• Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
• Monus semantics in vector addition systems with states
• Box-reachability in vector addition systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089305)