Dejun Hao
Abstract
Timed automata is an universal tool for modeling the real-time system。It's important to management of time constraints when computing reachability relation of the states.Based on the existing algorithms,this article gives an algorithm of how to management the timed system which includes difference constrains.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Timed automata is an universal tool for modeling the real-time system。It's important to management of time constraints when computing reachability relation of the states.Based on the existing algorithms,this article gives an algorithm of how to management the timed system which includes difference constrains.
Key concepts: Computer science, Reachability, Automaton, Timed automaton, Relation (database), Theoretical computer science, Reachability problem, Algorithm