Well-Structured Pushdown Systems

DOI10.1007/978-3-642-40184-8_10zbMath1390.68461OpenAlexW1503624459MaRDI QIDQ2842101

Mizuhito Ogawa, Xiaojuan Cai

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)

Related Items (8)

Reactive synthesis from visibly register pushdown automata ⋮ Nested Timed Automata with Frozen Clocks ⋮ Analyzing pushdown systems with stack manipulation ⋮ Unnamed Item ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Verifying quantitative temporal properties of procedural programs ⋮ Hardness Results for Coverability Problem of Well-Structured Pushdown Systems ⋮ Data Multi-Pushdown Automata

This page was built for publication: Well-Structured Pushdown Systems