Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
From MaRDI portal
Publication:4972152
DOI10.1145/3326161zbMath1433.68194WikidataQ127707694 ScholiaQ127707694MaRDI QIDQ4972152
Ranko Lazić, Lorenzo Clemente, Sławomir Lasota, Filip Mazowiecki
Publication date: 22 November 2019
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/119092/1/WRAP-binary-reachability-timed-register-pushdown-automata-vector-Lazic-2019.pdf
timed automata; pushdown automata; branching vector addition systems; timed-register pushdown automata
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items