Ordered multi-stack visibly pushdown automata

DOI10.1016/J.TCS.2016.08.012zbMath1353.68161OpenAlexW2512356998MaRDI QIDQ344793

Dario Carotenuto, Aniello Murano, Adriano Peron

Publication date: 24 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.012

zbMATH Keywords

formal verificationmodel checkingformal languagespushdown automataautomata-theoretic approach to system verificationvisibly automata

Mathematics Subject Classification ID

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

Related Items (6)

Input-Driven Double-Head Pushdown Automata ⋮ Sweeping input-driven pushdown automata ⋮ Unnamed Item ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Digging input-driven pushdown automata ⋮ Context-free timed formalisms: robust automata and linear temporal logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of well-formed communicating recursive state machines
• Pushdown module checking
• Automata-theoretic techniques for modal logics of programs
• Pushdown module checking with imperfect information
• Model-Checking of Ordered Multi-Pushdown Automata
• A Unifying Approach for Multistack Pushdown Automata
• Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
• Efficient CTL Model-Checking for Pushdown Systems
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• Enriched MU-Calculi Module Checking
• The Language Theory of Bounded Context-Switching
• Visibly pushdown languages
• From Multi to Single Stack Automata
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Can message buffers be axiomatized in linear temporal logic?
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS
• 2-Visibly Pushdown Automata
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• Scope-Bounded Pushdown Languages
• Reachability Analysis of Communicating Pushdown Systems
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: Ordered multi-stack visibly pushdown automata