Verification for Timed Automata Extended with Unbounded Discrete Data Structures

DOI10.1007/978-3-662-44584-6_35zbMath1417.68104arXiv1403.6303OpenAlexW419990173MaRDI QIDQ3190139

Karin Quaas

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.6303

Mathematics Subject Classification ID

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)

This page was built for publication: Verification for Timed Automata Extended with Unbounded Discrete Data Structures