scientific article; zbMATH DE number 7559494

DOI10.4230/LIPIcs.CONCUR.2020.38MaRDI QIDQ5089305

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

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilityweighted graphsvector addition systems with states

Mathematics Subject Classification ID

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

Related Items

Coverability in 2-VASS with one unary counter is in NP, Strategic reasoning with a bounded number of resources: the quest for tractability, Unnamed Item

Cites Work

• Unnamed Item
• On parametric timed automata and one-counter machines
• Model checking memoryful linear-time logics over one-counter automata
• The covering and boundedness problems for vector addition systems
• A multiparameter analysis of the boundedness problem for vector addition systems
• The Exact Path Length Problem
• Reachability in Register Machines with Polynomial Updates
• Reachability in Succinct and Parametric One-Counter Automata
• Model Checking Succinct and Parametric One-Counter Automata
• New Parallel-Sorting Schemes
• The Complexity of Flat Freeze LTL
• The reachability problem for Petri nets is not elementary
• Computational Complexity
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete