scientific article; zbMATH DE number 7407775

MaRDI QIDQ5155664

Mikhail Raskin, Michael Blondin

Publication date: 8 October 2021

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

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

zbMATH Keywords

computational complexityreachabilityaffine transformationvector addition system

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of population protocols
• A structure to decide reachability in Petri nets
• Some decision problems related to the reachability problem for Petri nets
• How hard is it to verify flat affine counter systems with the finite monoid property?
• Context-free commutative grammars with integer counters and resets
• The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
• Complexity Analysis of Continuous Petri Nets
• Unbounded-Thread Program Verification using Thread-State Equations
• Extending the Rackoff technique to Affine nets
• Integer Vector Addition Systems with States
• Reasoning about systems with many processes
• Demystifying Reachability in Vector Addition Systems
• Affine Parikh automata
• The Logical View on Continuous Petri Nets
• Vector addition system reachability problem
• DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES

This page was built for publication: