An Efficient Algorithm for Minimizing Real-Time Transition Systems |
| |
Authors: | Mihalis Yannakakis David Lee |
| |
Affiliation: | (1) Bell Laboratories, Murray Hill, NJ, 07974 |
| |
Abstract: | We address the problem of performing simultaneously reachability analysis and minimization of real-time transition systems represented by timed automata, i.e., automata extended with a finite set of clock variables. The transitions of the automaton may depend on the values of the clocks and may reset some of the clocks. An efficient algorithm is presented for minimizing a system with respect to a given initial partition that respects the enabling conditions of the transitions of the timed automaton. Our algorithm generates the portion of the minimized system that is reachable from a given initial configuration in time polynomial in the input and the size of the minimal reachable system. |
| |
Keywords: | timed systems minimization verification transition systems bisimulation |
本文献已被 SpringerLink 等数据库收录! |