Parametric Deadlock-Freeness Checking Timed Automata
From MaRDI portal
Publication:3179417
DOI10.1007/978-3-319-46750-4_27zbMath1482.68132OpenAlexW2522219859MaRDI QIDQ3179417
Publication date: 21 December 2016
Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46750-4_27
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)
Related Items
Safe Decomposition of Startup Requirements: Verification and Synthesis ⋮ \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Distributed parametric model checking timed automata under non-zenoness assumption
Uses Software
Cites Work