A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Lazy Reachability Checking for Timed Automata with Discrete Variables
[chapter]
2018
Lecture Notes in Computer Science
Systems and software with time dependent behavior are often formally specified using timed automata. For practical real-time systems, these specifications typically contain discrete data variables with nontrivial data flow besides real-valued clock variables. In this paper, we propose a lazy abstraction method for the location reachability problem of timed automata that can be used to efficiently control the visibility of discrete variables occurring in such specifications, this way alleviating
doi:10.1007/978-3-319-94111-0_14
fatcat:lkb3gkjv6rfttb3kkqjepdubb4