MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Checking Hybrid Automata for Linear Duration Invariants

Download:
pdf | ps
by Li Xu, Dang Van Hung, Zheng Tao
http://www.iist.unu.edu/newrh/III/1/docs/techreports/report109.ps.gz
Add To MetaCart

Abstract:

development of high integrity computing systems, (ii) highest level post-graduate university teaching, (iii) international level research, and, through the above, (iv) use of as sophisticated software as reasonable. UNU/IIST contributes through: (a) advanced, joint industry--university advanced development projects in which rigorous techniques supported by semantics-based tools are applied in case studies to software systems development, (b) own and joint university and academy institute research in which new techniques for (1) application domain and computing platform modelling, (2) requirements capture, and (3) software design & programming are being investigated, (c) advanced, post-graduate and post-doctoral level courses which typically teach Design Calculi oriented software development techniques, (d) events [panels, task forces, workshops and symposia], and (e) dissemination. Application-wise, the advanced development projects presently focus on software to support large-scale infrastructure systems such as transport systems (railways, airlines, air traffic, etc.), manufacturing industries, public administration, telecommunications, etc., and are thus aligned with UN and International Aid System concerns. UNU/IIST is a leading software technology centre in the area of infrastructure software development. UNU/IIST is also a leading research centre in the area of Duration Calculi, i.e. techniques applicable to realtime,

Citations

1393 A theory of timed automata – Alur, Dill - 1994
449 The algorithmic analysis of hybrid systems – Alur, Courcoubetis, et al. - 1995
265 The theory of hybrid automata – Henzinger - 1996
258 Representation of events in nerve nets and finite automata – Kleene - 1956
257 A calculus of duration – Chaochen, Hoare, et al. - 1991
69 Integration graphs: a class of decidable hybrid systems – Kesten, Pnueli, et al. - 1993
23 Towards a duration calculus proof assistant in PVS – Skakkebaek, Shankar - 1994
21 Linear duration invariants – Chaochen, Jingzhong, et al. - 1993
15 Checking Linear Duration Invariants by Linear Programming – Dong, Hung - 1996
12 Checking hybrid automata for linear duration invariants – Dong, Hung, et al. - 1997
1 A Proofs of Lemmas In this appendix, we present the proof of Lemmas 1\Gamma6. These lemmas will be proved by induction on the structure of context. Since the proof for the structures R \Phi C 1 (X) and RC 1 (X) is similar to the one of the structures C 1 – Concurrence, Parallelism, et al.
1 C(X) = C 1 (X)R 1 where R 1 is an HRE – Let - 1997