#### DMCA

## Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems (1992)

### Cached

### Download Links

- [www-cad.eecs.berkeley.edu]
- [www-cad.eecs.berkeley.edu]
- [www-cad.eecs.berkeley.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 460 - 20 self |

### Citations

578 | Symbolic model checking for real-time systems.
- Henzinger
- 1994
(Show Context)
Citation Context ...med automata can be extended to obtain semidecision procedures for solving the verification problem for linear hybrid automata. In particular, we consider the fixpoint computation method presented in =-=[HNSY92]-=- and the minimization procedure for timed automata presented in [ACH + 92]. Both methods perform a reachability analysis over the infinite state space of a timed automaton by computing with sets of st... |

507 |
D.L.: Automata for modeling real-time systems.
- Alur, Dill
- 1990
(Show Context)
Citation Context ...is labeled with a guarded set of assignments. This model for hybrid systems is inspired by the phase transition systems of [MMP92] and [NSY92], and can be viewed as a generalization of timed automata =-=[AD90]-=-. The current paper pursues three objectives. First, hybrid automata are defined and their suitability for specification is demonstrated through some paradigmatic examples. Second, the verification pr... |

268 |
A calculus of durations”,
- Chaochen, Hoare, et al.
- 1991
(Show Context)
Citation Context ... if a = 2 and b = 3: in this case, it will never happen that the control of P 1 is in location 4 while the control of P 2 is in location D. Leaking gas burner Now we consider an integrator system. In =-=[CHR91]-=-, the duration calculus is used to prove that a gas burner does not leak excessively. It is known that (1) any leakage can be detected and stopped within 1 second and (2) the gas burner will not leak ... |

242 | A fast mutual exclusion algorithm
- Lamport
- 1987
(Show Context)
Citation Context ...Each process has a critical section and at each time instant, at most one of the two processes is allowed to be in its critical section. Mutual exclusion is ensured by a version of Fischer's protocol =-=[Lam87]-=-, which we describe first in pseudocode. For each process P i , where i = 1; 2: 1 2 3 4 x' = 1 x' = 1 k = 0 x:=0 k:=1; x:=0 ks1 k := 0 k = 0 k := 0 ks2 y:=0 y' = 1.1 y' = 1.1 k:=2; y:=0 A B C D k=0 k=... |

173 | From timed to hybrid systems.
- Maler, Manna, et al.
- 1992
(Show Context)
Citation Context ...hat must hold while the control resides at the location, and each transition is labeled with a guarded set of assignments. This model for hybrid systems is inspired by the phase transition systems of =-=[MMP92]-=- and [NSY92], and can be viewed as a generalization of timed automata [AD90]. The current paper pursues three objectives. First, hybrid automata are defined and their suitability for specification is ... |

90 | Minimization of timed transition systems, in: - Alur, Halbwachs, et al. - 1992 |

90 | An approach to the description and analysis of hybrid systems.
- Nicollin, Olivero, et al.
- 1993
(Show Context)
Citation Context ...ons. Third, and most importantly, we successfully verify interesting properties of truly hybrid system behaviors. We note that Nicollin et al. have independently developed an approach similar to ours =-=[NSOY]-=-. For verification purposes, we restrict ourselves to linear hybrid automata. In a linear hybrid automaton, for each variable the rate of change with time is constant --- though this constant may vary... |

84 | From ATP to timed graphs and hybrid systems
- Nicollin, Sifakis, et al.
- 1993
(Show Context)
Citation Context ...d while the control resides at the location, and each transition is labeled with a guarded set of assignments. This model for hybrid systems is inspired by the phase transition systems of [MMP92] and =-=[NSY92]-=-, and can be viewed as a generalization of timed automata [AD90]. The current paper pursues three objectives. First, hybrid automata are defined and their suitability for specification is demonstrated... |

74 |
Decidability of bisimulation equivalences for parallel timer processes.
- Cerans
- 1992
(Show Context)
Citation Context ...1 ofM� this shows that the emptiness problem is 1-complete for 2-rate timed automata [HPS83].) The second part of the theorem follows from an undecidability result for timed systems with memory cells =-=[Cerans]-=-. We point out that the emptiness problem is decidable for simplen-rate timed automata. This is because any simple asynchronous timed automaton can be transformed into a timed automaton by (1) factori... |

68 |
Minimal model generation
- Bouajjani, Fernandez, et al.
- 1990
(Show Context)
Citation Context ...rovided it is finite. For this purpose, we can adopt algorithms for performing a simultaneous reachability and minimization analysis of transition systems [BFH90, LY92]. The minimization procedure of =-=[BFH90] is given below. -=-Let �� 0 = f(`; true) j ` 2 Qg be the initial partition of \Sigma into regions --- one region per location. The initial partition is refined into �� 1 = �� 0 " fR f ; \Sigma \Gamma R ... |

62 |
Online minimization of transition systems. In:
- Lee, Yannakakis
- 1992
(Show Context)
Citation Context ...ess problem for A, even in presence of acceptance conditions, and for model checking branching-time properties. The minimization procedure may be replaced by the more efficient procedure presented in =-=[LY92]-=-, which can also be implemented using the primitive pre . 3.3 Verification examples In the following, we demonstrate that both the fixpoint computation procedure and the minimization procedure termina... |

7 |
Propositional dynamic logic of regular programs
- Harel, Pnueli, et al.
- 1983
(Show Context)
Citation Context ...can construct a 2-rate timed automaton that has a run iff a counter is 0 infinitely often along some run of M ; this shows that the emptiness problem is \Sigma 1 1 -complete for 2-rate timed automata =-=[HPS83].) T-=-he second part of the theorem follows from an undecidability result for timed systems with memory cells [ Cer��ans]. We point out that the emptiness problem is decidable for simple n-rate timed au... |

5 |
Real-Time Distributed System Specification and Verification in APTL
- Wang, Mok, et al.
- 1993
(Show Context)
Citation Context ...(1) factoring into 1-process timed automata, (2) scaling all 1-process timed automata to the same clock rate, and (3) constructing the product. An analogous result holds for real-time temporal logics =-=[WME92]. 3 Verification -=-Procedures Consider a linear hybrid system A = (V D ; Q; �� 1 ; �� 2 ; �� 3 ). Given a linear formula OE over VD , we wish to determine whether OE is an invariant of A: "Is OE true in... |

2 |
Real-time distributed system speci cation and veri cation in APTL
- Wang, Mok, et al.
- 1992
(Show Context)
Citation Context ...(1) factoring into 1-process timed automata, (2) scaling all 1-process timed automata to the same clock rate, and (3) constructing the product. An analogous result holds for real-time temporal logics =-=[WME92]-=-. 3 Veri cation Procedures Consider a linear hybrid systemA= (VD�Q� 1� 2� 3). Given a linear formula overVD, we wish to determine whether is an invariant ofA: \Is true in all states that occur on some... |

1 | Fromtimedtohybrid systems
- Maler, Manna, et al.
- 1992
(Show Context)
Citation Context ...hat must hold while the control resides at the location, and each transition is labeled with a guarded set of assignments. This model for hybrid systems is inspired by the phase transition systems of =-=[MMP92]-=- and [NSY92], and can be viewed as a generalization of timed automata [AD90]. The current paper pursues three objectives. First, hybrid automata are de ned and their suitability for speci cation is de... |