Data multi-pushdown automata
From MaRDI portal
Publication:5111652
DOI10.4230/LIPICS.CONCUR.2017.38zbMATH Open1442.68076OpenAlexW2757632766MaRDI QIDQ5111652FDOQ5111652
Authors: C. Aiswarya, Mohamed Faouzi Atig, Parosh A. Abdulla 
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2017.38
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Deciding properties of integral relational automata
- Model-checking of ordered multi-pushdown automata
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- Adjacent ordered multi-pushdown systems
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Reachability analysis of communicating pushdown systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Global model checking of ordered multi-pushdown systems
- MSO decidability of multi-pushdown systems via split-width
- The tree width of auxiliary storage
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Budget-bounded model-checking pushdown systems
- Model checking languages of data words
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Acceleration in multi-pushdown systems
- Controllers for the verification of communicating multi-pushdown systems
- Verifying communicating multi-pushdown systems via split-width
- Well-structured pushdown systems
- The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
- Reachability analysis of first-order definable pushdown systems
- Analyzing Timed Systems Using Tree Automata
- Verification of parameterized communicating automata via split-width
- Push-down automata with gap-order constraints
Cited In (12)
- Reachability of scope-bounded multistack pushdown systems
- Title not available (Why is that?)
- Push-down automata with gap-order constraints
- Controllers for the verification of communicating multi-pushdown systems
- Verifying communicating multi-pushdown systems via split-width
- Model checking languages of data words
- Title not available (Why is that?)
- Reachability problem for weak multi-pushdown automata
- Reachability problem for weak multi-pushdown automata
- MSO decidability of multi-pushdown systems via split-width
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Bounded context switching for valence systems
This page was built for publication: Data multi-pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111652)
