Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems
No abstract available.
DOI 10.1007/3-540-56922-7_10
Related papers
- ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States TOPLAS 2019
- Reachability in Continuous Pushdown VASS POPL 2024
- Vector addition system reachability problem: a short self-contained proof POPL 2011
- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs ESOP 2015
- Analysis of Recursively Parallel Programs TOPLAS 2013
- Analysis of recursively parallel programs POPL 2012
- On Polynomial Expressions with C-Finite Recurrences in Loops with Nested Nondeterministic Branches CAV 2024
- A Verification Procedure via Invariant for Extended Communicating Finite-State Machines CAV 1992