Timed pushdown automata and branching vector addition systems

MaRDI QIDQ5144629zbMATH OpenFDO

Authors Lorenzo Clemente, Sławomir Lasota, Ranko Lazić, Filip Mazowiecki

Publication date 19 January 2021

Full work available at URL http://dl.acm.org/citation.cfm?id=3330018

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

• Binary reachability of timed-register pushdown automata and branching vector addition systems
• Timed Pushdown Automata Revisited
• Decomposing timed push down automata
• Reachability relations of timed pushdown automata
• scientific article; zbMATH DE number 1949647

Cited in

(9)

• Adding dense-timed stack to integer reset timed automata
• Decomposing timed push down automata
• Relating timed and register automata
• Binary reachability of timed-register pushdown automata and branching vector addition systems
• Timed Basic Parallel Processes
• Reachability for bounded branching VASS
• On the reachability problem for two-dimensional branching VASS
• Bridging the gap between plain VASS and branching VASS
• Fast zone-based algorithms for reachability in pushdown timed automata

This page was built for publication: Timed pushdown automata and branching vector addition systems

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