Model-checking of ordered multi-pushdown automata

DOI10.2168/LMCS-8(3:20)2012MaRDI QIDQ2914241zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig

Publication date 25 September 2012

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-8(3:20)2012

zbMATH Keywords

LTL model-checkingmulti-pushdown automataprogram verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Global model checking of ordered multi-pushdown systems
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• Model-checking bounded multi-pushdown systems
• Adjacent ordered multi-pushdown systems
• Ordered multi-stack visibly pushdown automata

Cited in

(15)

• The complexity of model checking multi-stack systems
• A perfect class of context-sensitive timed languages
• On Model Checking for Visibly Pushdown Automata
• Global model checking of ordered multi-pushdown systems
• Ordered multi-stack visibly pushdown automata
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• From multi to single stack automata
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• Analyzing timed systems using tree automata
• Revisiting underapproximate reachability for multipushdown systems
• Data multi-pushdown automata
• On the path-width of integer linear programming
• Adjacent ordered multi-pushdown systems
• Adjacent ordered multi-pushdown systems
• Parameterized verification under TSO with data types

This page was built for publication: Model-checking of ordered multi-pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914241)