Data Multi-Pushdown Automata
From MaRDI portal
Publication:5111652
DOI10.4230/LIPIcs.CONCUR.2017.38zbMath1442.68076OpenAlexW2757632766MaRDI QIDQ5111652
Mohamed Faouzi Atig, C. Aiswarya, Parosh Aziz Abdulla
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2017.38
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Cites Work
- Unnamed Item
- Budget-bounded model-checking pushdown systems
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Acceleration in multi-pushdown systems
- Verification of Parameterized Communicating Automata via Split-Width
- Well-Structured Pushdown Systems
- The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
- Model Checking Languages of Data Words
- Global Model Checking of Ordered Multi-Pushdown Systems
- MSO Decidability of Multi-Pushdown Systems via Split-Width
- Model-Checking of Ordered Multi-Pushdown Automata
- Push-Down Automata with Gap-Order Constraints
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
- Controllers for the Verification of Communicating Multi-pushdown Systems
- Verifying Communicating Multi-pushdown Systems via Split-Width
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Analyzing Timed Systems Using Tree Automata
- Deciding properties of integral relational automata
- ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS
- The tree width of auxiliary storage
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Tools and Algorithms for the Construction and Analysis of Systems
- Reachability Analysis of Communicating Pushdown Systems
