Data multi-pushdown automata

DOI10.4230/LIPICS.CONCUR.2017.38zbMATH Open1442.68076OpenAlexW2757632766MaRDI QIDQ5111652FDOQ5111652

Parosh A. Abdulla, Mohamed Faouzi Atig, C. Aiswarya

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2017.38

Recommendations

• Reachability of scope-bounded multistack pushdown systems
• Reachability of multistack pushdown systems with scope-bounded matching relations
• Reachability problem for weak multi-pushdown automata
• Reachability problem for weak multi-pushdown automata
• Push-down automata with gap-order constraints

zbMATH Keywords

pushdown systemsmodel-checkingbounded split-widthgap-order

Mathematics Subject Classification ID

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
• Title not available (Why is that?)
• Analyzing Timed Systems Using Tree Automata
• Verification of Parameterized Communicating Automata via Split-Width
• Push-Down Automata with Gap-Order Constraints

Cited In (3)

• Title not available (Why is that?)
• Bounded Context Switching for Valence Systems
• Title not available (Why is that?)

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)