Revisiting Underapproximate Reachability for Multipushdown Systems

DOI10.1007/978-3-030-45190-5_21OpenAlexW3021938607MaRDI QIDQ5039520

Paul Gastin, Shankara Narayanan Krishna, Sparsa Roychowdhury, S. Akshay

Publication date: 13 October 2022

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.05950

zbMATH Keywords

timed pushdown automatamultipushdown systemsunderapproximate reachability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Fast zone-based algorithms for reachability in pushdown timed automata

Uses Software

• MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Perfect Class of Context-Sensitive Timed Languages
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• MSO Decidability of Multi-Pushdown Systems via Split-Width
• Model-Checking of Ordered Multi-Pushdown Automata
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• Dense-Timed Pushdown Automata
• Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
• The Language Theory of Bounded Context-Switching
• Visibly pushdown languages
• Concurrent manipulation of binary search trees
• Towards an Efficient Tree Automata based technique for Timed Systems
• The tree width of auxiliary storage
• Scope-Bounded Pushdown Languages
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Revisiting Underapproximate Reachability for Multipushdown Systems