Well-structured pushdown systems

DOI10.1007/978-3-642-40184-8_10MaRDI QIDQ2842101zbMATH OpenOpenAlexFDO

Authors Xiaojuan Cai, Mizuhito Ogawa

Publication date 12 August 2013

Published in CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40184-8_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Hardness results for coverability problem of well-structured pushdown systems
• Program Analysis Using Weighted Pushdown Systems
• Well-structured pushdown system: case of dense timed pushdown automata
• Well-structured transition systems everywhere!
• Pushdown systems with stack manipulation

Cited in

(12)

• Analyzing pushdown systems with stack manipulation
• Reactive synthesis from visibly register pushdown automata
• Data flow analysis of asynchronous systems using infinite abstract domains
• Acceleration in multi-pushdown systems
• Nested timed automata with frozen clocks
• On the coverability problem for pushdown vector addition systems in one dimension
• Verifying quantitative temporal properties of procedural programs
• Well structured transition systems with history
• Data multi-pushdown automata
• Pushdown systems with stack manipulation
• Well-structured pushdown system: case of dense timed pushdown automata
• Hardness results for coverability problem of well-structured pushdown systems

This page was built for publication: Well-structured pushdown systems

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