Automata, Languages and Programming
From MaRDI portal
Publication:5716855
DOI10.1007/11523468zbMath1085.68078OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716855
Johann Deneux, Joël Ouaknine, Parosh Aziz Abdulla, James Worrell
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (9)
Model Checking Real-Time Systems ⋮ Minimization of the number of clocks for timed scenarios ⋮ Untangling the graphs of timed automata to decrease the number of clocks ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ An efficient customized clock allocation algorithm for a class of timed automata ⋮ Event-Clock Visibly Pushdown Automata ⋮ The ω-Regular Post Embedding Problem ⋮ Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems ⋮ Generalized Post embedding problems
This page was built for publication: Automata, Languages and Programming
