On Clock-Aware LTL Properties of Timed Automata
暂无分享,去创建一个
Ivana Cerná | Jiri Barnat | Nikola Benes | Peter Bezdek | Vojtech Havel | J. Barnat | I. Cerná | Vojtech Havel | Nikola Benes | Peter Bezdek
[1] Stavros Tripakis,et al. Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.
[2] Patricia Bouyer,et al. Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..
[3] Joseph Sifakis,et al. Tools and Applications II: The IF Toolset , 2004 .
[4] Ron Koymans,et al. Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.
[5] Rajeev Alur,et al. Decision Problems for Timed Automata: A Survey , 2004, SFM.
[6] Igor Walukiewicz,et al. Efficient emptiness check for timed Büchi automata , 2010, Formal Methods in System Design.
[7] Jonathan S. Ostroff,et al. Temporal logic for real-time systems , 1989 .
[8] Deepak D'Souza,et al. An automata-theoretic approach to constraint LTL , 2002, Inf. Comput..
[9] Christel Baier,et al. Principles of Model Checking (Representation and Mind Series) , 2008 .
[10] Wolfgang Reisig,et al. Lectures on Concurrency and Petri Nets , 2003, Lecture Notes in Computer Science.
[11] KoymansRon. Specifying real-time properties with metric temporal logic , 1990 .
[12] Ajitha Rajan,et al. Requirements Coverage as an Adequacy Measure for Conformance Testing , 2008, ICFEM.
[13] Frédéric Herbreteau,et al. E!cient Emptiness Check for Timed Buchi Automata (Extended version) , 2011 .
[14] Wang Yi,et al. UPPAAL - present and future , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).
[15] Guangyuan Li,et al. Modelling Real-Time Systems with Continuous-Time Temporal Logic , 2002, ICFEM.
[16] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[17] Lubos Brim,et al. DiVinE 3.0 - An Explicit-State Model Checker for Multithreaded C & C++ Programs , 2013, CAV.
[18] Wa Halang,et al. REAL-TIME SYSTEMS .2. , 1989 .
[19] Guangyuan Li. Checking Timed Büchi Automata Emptiness Using LU-Abstractions , 2009, FORMATS.
[20] Alfons Laarman,et al. Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction , 2013, CAV.
[21] Stavros Tripakis,et al. Checking timed Büchi automata emptiness on simulation graphs , 2009, TOCL.
[22] David L. Dill,et al. Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.
[23] Thomas A. Henzinger,et al. The benefits of relaxing punctuality , 1991, JACM.
[24] Stavros Tripakis,et al. Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..
[25] Kim G. Larsen,et al. A Tutorial on Uppaal , 2004, SFM.
[26] Stephan Merz,et al. Model Checking , 2000 .
[27] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[28] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[29] Wang Yi,et al. Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.
[30] Thomas A. Henzinger,et al. A really temporal logic , 1994, JACM.
[31] Amir Pnueli,et al. Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[32] Jirí Srba,et al. Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.
[33] Paul Pettersson. Modelling and Verification of Real-Time Systems Using Timed Automata : Theory and Practice , 1999 .
[34] Christel Baier,et al. Principles of model checking , 2008 .