Data multi-pushdown automata

DOI10.4230/LIPICS.CONCUR.2017.38MaRDI QIDQ5111652zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• Acceleration in multi-pushdown systems
• Adjacent ordered multi-pushdown systems
• Analyzing Timed Systems Using Tree Automata
• Budget-bounded model-checking pushdown systems
• Controllers for the verification of communicating multi-pushdown systems
• Deciding properties of integral relational automata
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• Global model checking of ordered multi-pushdown systems
• MSO decidability of multi-pushdown systems via split-width
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• Model checking languages of data words
• Model-checking of ordered multi-pushdown automata
• Push-down automata with gap-order constraints
• Reachability analysis of communicating pushdown systems
• Reachability analysis of first-order definable pushdown systems
• Reachability of multistack pushdown systems with scope-bounded matching relations
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• The tree width of auxiliary storage
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification of parameterized communicating automata via split-width
• Verifying communicating multi-pushdown systems via split-width
• Well-structured pushdown systems

Cited in

(12)

• Bounded context switching for valence systems
• Reachability of scope-bounded multistack pushdown systems
• scientific article; zbMATH DE number 5593273 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 6109856 (Why is no real title available?)
• 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

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)