Checking linear duration invariants by linear programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1179, Issue , 1996, Pages 321-332

  Xuandong, Li ^a   Van Hung, Dang ^a  

^a UNITED NATIONS UNIVERSITY   (Macao)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; PATTERN MATCHING;

DURATION CALCULUS; LINEAR DURATION; REAL TIME; REAL-TIME AUTOMATON; REGULAR EXPRESSIONS; TIMED AUTOMATA;

LINEAR PROGRAMMING;

EID: 84947943322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0027804     Document Type: Conference Paper

References (8)

1. Rajeev Alur, David L. Dill. A theory of timed automata. In Theoretical Computer Science, 126(1994), pp.183-235.
2. Zhou Chaochen, Zhang Jingzhong, Yang Lu, and Li Xiaoshan. Linear Duration Invariants. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp.88-109.
3. Zhou Chaochen, C.A.R. Hoare, A.P. Ravn. A Calculus of Durations. In Information Processing Letter, 40, 5, 1991, pp.269-276.
4. Michael R. Hansen. Model-Checking Discrete Duration Calculus. In Formal Aspects of Computing (1994) 6A, pp.826-845.
5. Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid System, LNCS 736, pp.179-208.
6. S C Kleene. Representation of Events in Nerve Nets and Finite Automata. In Automata Studies, C.Shannon and J. McCarthy (eds.), Princeton Univ. Press,Princeton, NJ, 1956, pp.3-41.
7. J. U. Skakkebaek, and N. Shankar. Towards a Duration Calculus proof assistant m PVS. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863,pp.660-697.
8. Li Xuandong, Dang Van Hung. Checking Linear Duration Invariants by Linear ' Programming. Research report 70, UNU/IIST, P.O.Box 3058, Macau, May 1996.