Verification for Timed Automata extended with Unbounded Discrete Data Structures
From MaRDI portal
Publication:3196352
DOI10.2168/LMCS-11(3:20)2015zbMath1448.68314OpenAlexW2763333357MaRDI QIDQ3196352
Publication date: 29 October 2015
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-11(3:20)2015
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)
Related Items