scientific article; zbMATH DE number 7438572
From MaRDI portal
Publication:5013882
zbMath1476.68162arXiv1509.07203MaRDI QIDQ5013882
Giorgio Delzanno, Marco Montali, Parosh Aziz Abdulla
Publication date: 3 December 2021
Full work available at URL: https://arxiv.org/abs/1509.07203
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- A classification of the expressive power of well-structured transition systems
- Deciding branching time properties for asynchronous programs
- On the coverability and reachability languages of monotonic extensions of Petri nets
- Well-Structured Pushdown Systems
- Push-Down Automata with Gap-Order Constraints
- Constraint-based automatic verification of abstract models of multithreaded programs
- Nets with Tokens Which Carry Data
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- History-Register Automata
- Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata
- Fresh-register automata
- Well-structured transition systems everywhere!
- Ensuring completeness of symbolic verification methods for infinite-state systems
This page was built for publication: