Analysis of Timed Systems Based on Time-Abstracting Bisimulation
暂无分享,去创建一个
[1] Rajeev Alur,et al. Minimization of Timed Transition Systems , 1992, CONCUR.
[2] David Lee,et al. Online minimization of transition systems (extended abstract) , 1992, STOC '92.
[3] Laurent Mounier,et al. "On the Fly" Verification of Behavioural Equivalences and Preorders , 1991, CAV.
[4] Wang Yi,et al. Time Abstracted Bisimiulation: Implicit Specifications and Decidability , 1993, MFPS.
[5] Nicolas Halbwachs,et al. Minimal State Graph Generation , 1992, Sci. Comput. Program..
[6] Conrado Daws,et al. Two examples of verification of multirate timed automata with Kronos , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.
[7] Joseph Sifakis,et al. Using Abstractions for the Verification of Linear Hybrid Systems , 1994, CAV.
[8] Joseph Sifakis,et al. A Toolbox For The Verification Of LOTOS Programs , 1992, International Conference on Software Engineering.
[9] Nicolas Halbwachs,et al. An implementation of three algorithms for timing verification based on automata emptiness , 1992, [1992] Proceedings Real-Time Systems Symposium.
[10] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[11] Conrado Daws,et al. Verifying ET-LOTOS programmes with KRONOS , 1994, FORTE.
[12] David Lee,et al. An Efficient Algorithm for Minimizing Real-Time Transition Systems , 1997, Formal Methods Syst. Des..
[13] Stavros Tripakis,et al. The Tool KRONOS , 1996, Hybrid Systems.
[14] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.