Ordered multi-stack visibly pushdown automata

DOI10.1016/J.TCS.2016.08.012MaRDI QIDQ344793zbMATH OpenOpenAlexFDO

Authors 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

model checkingformal languagespushdown automataformal verificationautomata-theoretic approach to system verificationvisibly automata

Mathematics Subject Classification ID

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

Recommendations

• 2-Visibly Pushdown Automata
• A unifying approach for multistack pushdown automata
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Model-checking of ordered multi-pushdown automata
• Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata

Cites work

• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1980931 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• 2-Visibly Pushdown Automata
• A unifying approach for multistack pushdown automata
• Adjacent ordered multi-pushdown systems
• Automata-theoretic techniques for modal logics of programs
• Can message buffers be axiomatized in linear temporal logic?
• Distributed systems. Principles and paradigms.
• Efficient CTL model-checking for pushdown systems
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• Enriched MU-Calculi Module Checking
• From multi to single stack automata
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• Model-checking of ordered multi-pushdown automata
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Pushdown module checking
• Pushdown module checking with imperfect information
• Reachability analysis of communicating pushdown systems
• Reachability analysis of pushdown automata: Application to model-checking
• Reachability of multistack pushdown systems with scope-bounded matching relations
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Scope-bounded pushdown languages
• The language theory of bounded context-switching
• Verification of well-formed communicating recursive state machines
• Visibly pushdown languages

Cited in

(12)

• Context-free timed formalisms: robust automata and linear temporal logics
• Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
• Digging input-driven pushdown automata
• Model-checking of ordered multi-pushdown automata
• Input-driven double-head pushdown automata
• Visit-bounded stack automata
• Visit-bounded stack automata
• Sweeping input-driven pushdown automata
• 2-Visibly Pushdown Automata
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• Input-Driven Double-Head Pushdown Automata
• A unifying approach for multistack pushdown automata

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

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