Time Petri Nets Analysis with TINA
暂无分享,去创建一个
[1] François Vernadat,et al. State Class Constructions for Branching Analysis of Time Petri Nets , 2003, TACAS.
[2] Alain Kerbrat,et al. CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.
[3] Bernard Berthomieu,et al. An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.
[4] Enrico Vicario,et al. Timed state space analysis of real-time preemptive systems , 2004, IEEE Transactions on Software Engineering.
[5] P. Merlin,et al. Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.
[6] Didier Lime,et al. Expressiveness and analysis of scheduling extended time Petri nets , 2003 .
[7] A. Arnold. Systèmes de transitions finis et sémantique des processus communicants , 1990 .
[8] F. Vernadat,et al. The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .
[9] François Vernadat,et al. On Combining the Persistent Sets Method with the Covering Steps Graph Method , 2002, FORTE.
[10] Didier Lime,et al. Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches , 2007, Discret. Event Dyn. Syst..
[11] M. Diaz,et al. Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..
[12] Joël Ouaknine,et al. State/Event-Based Software Model Checking , 2004, IFM.