HAT: analyzing linear hybrid automata as labelled transition system
DOI10.1007/978-3-030-01461-2_5zbMath1518.68163OpenAlexW2893139455MaRDI QIDQ6165771
Xuandong Li, Enyi Tang, Lei Bu, Hui Jiang, Xin Chen
Publication date: 2 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-01461-2_5
transition systeminvariant generationtermination analysislinear hybrid automatareachability checking
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)
This page was built for publication: HAT: analyzing linear hybrid automata as labelled transition system