Binary reachability of timed-register pushdown automata and branching vector addition systems

DOI10.1145/3326161MaRDI QIDQ4972152zbMATH OpenOpenAlexWikidataFDO

Authors Lorenzo Clemente, Sławomir Lasota, Ranko Lazić, 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

zbMATH Keywords

pushdown automatatimed automatabranching vector addition systemstimed-register pushdown automata

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

• Timed pushdown automata and branching vector addition systems
• Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
• scientific article; zbMATH DE number 1670769
• Reachability relations of timed pushdown automata
• Reachability in pushdown register automata

Cited in

(5)

• Reachability relations of timed pushdown automata
• Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
• Timed pushdown automata and branching vector addition systems
• Relating timed and register automata
• Relating timed and register automata

This page was built for publication: Binary reachability of timed-register 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 Q4972152)