Formal verification of timed systems: a survey and perspective

An overview of the current state of the art of formal verification of real-time systems is presented. We discuss commonly accepted models, specification languages, verification frameworks, state-space representation schemes, state-space construction procedures, reduction techniques, pioneering tools, and finally some new related issues. We also make a few comments according to our experience with verification tool design and implementation.

[1]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[2]  Stephan Merz,et al.  Model Checking - Timed UML State Machines and Collaborations , 2002, FTRTFT.

[3]  Harry Foster,et al.  Principles of verifiable RTL design - a functional coding style supporting verification processes in Verilog , 2000 .

[4]  Guy Leduc,et al.  A Formal Definition of Time in LOTOS , 1998, Formal Aspects of Computing.

[5]  Parosh Aziz Abdulla,et al.  On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels , 1998, CAV.

[6]  A. Prasad Sistla,et al.  Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach , 1997, TOPL.

[7]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[8]  Jan A. Bergstra,et al.  Real time process algebra with infinitesimals , 1993 .

[9]  Natarajan Shankar,et al.  Subtypes for Specifications: Predicate Subtyping in PVS , 1998, IEEE Trans. Software Eng..

[10]  Patricia Bouyer,et al.  Untameable Timed Automata! , 2003, STACS.

[11]  Stephen J. Garland,et al.  Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.

[12]  Thomas A. Henzinger,et al.  A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking , 1996, CONCUR.

[13]  M. Oliver Möller.  Parking can get you there faster - Model Augmentation to Speed up Real-Time Model-Checking , 2002, Electron. Notes Theor. Comput. Sci..

[14]  A. Pnueli,et al.  CONTROLLER SYNTHESIS FOR TIMED AUTOMATA , 2006 .

[15]  Nancy A. Lynch,et al.  Using I/O automata for developing distributed systems , 2000 .

[16]  Edmund M. Clarke,et al.  State space reduction using partial order techniques , 1999, International Journal on Software Tools for Technology Transfer.

[17]  Wang Yi,et al.  Efficient verification of real-time systems: compact data structure and state-space reduction , 1997, Proceedings Real-Time Systems Symposium.

[18]  Aloysius K. Mok,et al.  Modechart: A Specification Language for Real-Time Systems , 1994, IEEE Trans. Software Eng..

[19]  Farn Wang,et al.  High-Level Execution Time Analysis , 1997, ARTS.

[20]  Rance Cleaveland,et al.  Praobabilistic Resource Failure in Real-Time Process Algebra , 1998, CONCUR.

[21]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[22]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) , 1991, ICALP.

[23]  M. Gordon.  HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[24]  Ursula Goltz,et al.  Timed Sequence Diagrams and Tool-Based Analysis - A Case Study , 1999, UML.

[25]  E. Allen Emerson,et al.  Parametric quantitative temporal reasoning , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[26]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[27]  Douglas A. Stuart.  Implementing a verifier for real-time systems , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[28]  Henrik Ejersbo Jensen.  Model Checking Probabilistic Real Time Systems , 1996 .

[29]  Derek C. Oppen,et al.  A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..

[30]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[31]  Rajeev Alur,et al.  Counterexample-guided predicate abstraction of hybrid systems , 2003, Theor. Comput. Sci..

[32]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[33]  Thomas A. Henzinger,et al.  You Assume, We Guarantee: Methodology and Case Studies , 1998, CAV.

[34]  Stavros Tripakis,et al.  The Tool KRONOS , 1996, Hybrid Systems.

[35]  John M. Rushby,et al.  Theorem Proving for Verification , 2000, MOVEP.

[36]  Jim Woodcock,et al.  FME '93: Industrial-Strength Formal Methods , 1993, Lecture Notes in Computer Science.

[37]  Nancy A. Lynch,et al.  The Theory of Timed I/o Automata , 2003 .

[38]  Nancy A. Lynch,et al.  Simulation Techniques for Proving Properties of Real-Time Systems , 1993, REX School/Symposium.

[39]  Conrado Daws,et al.  Reducing the number of clock variables of timed automata , 1996, RTSS.

[40]  Nancy A. Lynch,et al.  Correctness of At-Most-Once Message Delivery Protocols , 1993, FORTE.

[41]  Liang Chen,et al.  An Interleaving Model for Real-Time Systems , 1992, LFCS.

[42]  Henrik Reif Andersen,et al.  Difference Decision Diagrams , 1999, CSL.

[43]  Farn Wang,et al.  Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.

[44]  Farn Wang,et al.  TCTL Inevitability Analysis of Dense-Time Systems , 2003, CIAA.

[45]  Florence Pagani,et al.  Partial Orders and Verification of Real-Time systems , 1996, FTRTFT.

[46]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[47]  Stavros Tripakis,et al.  On-the-fly symbolic model checking for real-time systems , 1997, Proceedings Real-Time Systems Symposium.

[48]  Constance L. Heitmeyer,et al.  MT: A toolset for specifying and analyzing real-time systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[49]  Insup Lee,et al.  A process algebraic approach to the specification and analysis of resource-bound real-time systems , 1994, Proc. IEEE.

[50]  Sanjit A. Seshia,et al.  Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods , 2003, CAV.

[51]  Wang Yi,et al.  Compositional and symbolic model-checking of real-time systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[52]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[53]  Faron Moller,et al.  Checking Regular Properties of Petri Nets , 1995, CONCUR.

[54]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[55]  Tomohiro Yoneda,et al.  Efficient Verification of Parallel Real–Time Systems , 1993, Formal Methods Syst. Des..

[56]  Dino Mandrioli,et al.  Formal Methods for Real-Time Computing , 1996 .

[57]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[58]  Amir Pnueli,et al.  Data-Structures for the Verification of Timed Automata , 1997, HART.

[59]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[60]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

[61]  Mark Lawford,et al.  MODEL REDUCTION OF DISCRETE REAL-TIME SYSTEMS , 1997 .

[62]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[63]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[64]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[65]  Pao-Ann Hsiung,et al.  User-Friendly Verification , 1999, FORTE.

[66]  Kenneth L. McMillan,et al.  A Compositional Rule for Hardware Design Refinement , 1997, CAV.

[67]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[68]  Rami R. Razouk,et al.  Performance Analysis Using Timed Petri Nets , 1984, PSTV.

[69]  Shmuel Katz,et al.  Saving Space by Fully Exploiting Invisible Transitions , 1996, Formal Methods Syst. Des..

[70]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[71]  Darmalingum Muthiayen,et al.  Real-time reactive system development: a formal approach based on uml and pvs , 2000 .

[72]  Kim G. Larsen,et al.  Static Guard Analysis in Timed Automata Verification , 2003, TACAS.

[73]  Olaf Stursberg,et al.  Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement , 2003, TACAS.

[74]  Robert E. Shostak,et al.  Deciding Combinations of Theories , 1982, JACM.

[75]  Natarajan Shankar,et al.  Verification of Real-Time Systems Using PVS , 1993, CAV.

[76]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[77]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[78]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[79]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[80]  Jeremy Sproston.  Decidable Model Checking of Probabilistic Hybrid Automata , 2000, FTRTFT.

[81]  Farn Wang,et al.  Numerical Coverage Estimation for the Symbolic Simulation of Real-Time Systems , 2003, FORTE.

[82]  Farn Wang,et al.  Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures , 2004, IEEE Transactions on Software Engineering.

[83]  Thomas A. Henzinger,et al.  jMocha: a model checking tool that exploits design structure , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[84]  Nancy A. Lynch,et al.  The generalized railroad crossing: a case study in formal verification of real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[85]  Farn Wang,et al.  Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions , 2004, AMAST.

[86]  Nicolas Guelfi,et al.  Real-Time Synchronized Petri Nets , 2002 .

[87]  F. Jahanian,et al.  Semantics of Modechart in real time logic , 1988, [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track.

[88]  Jan Gustafsson,et al.  Worst-case execution-time analysis for embedded real-time systems , 2003, International Journal on Software Tools for Technology Transfer.

[89]  Farnam Jahanian,et al.  A Method for Verifying Properties of Modechart Specifications , 1988, RTSS.

[90]  Wang Yi,et al.  Partial Order Reductions for Timed Systems , 1998, CONCUR.

[91]  Nicolas Halbwachs,et al.  Delay Analysis in Synchronous Programs , 1993, CAV.

[92]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[93]  Wang Yi,et al.  Efficient Timed Reachability Analysis Using Clock Difference Diagrams , 1998, CAV.

[94]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[95]  Gerard J. Holzmann,et al.  An improvement in formal verification , 1994, FORTE.

[96]  Alan C. Shaw,et al.  Communicating Real-Time State Machines , 1992, IEEE Trans. Software Eng..

[97]  A. Prasad Sistla,et al.  Quantitative temporal reasoning , 1990, Real-Time Systems.

[98]  Thomas A. Henzinger,et al.  What Good Are Digital Clocks? , 1992, ICALP.

[99]  Jos C. M. Baeten,et al.  Process Algebra with Timing: Real Time and Discrete Time , 1999, Handbook of Process Algebra.

[100]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[101]  Paolo Nesi,et al.  An Interval Logic for Real-Time System Specification , 2001, IEEE Trans. Software Eng..

[102]  Farn Wang,et al.  Region Encoding Diagram for fully symbolic verification of real-time systems , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.

[103]  Steve A. Schneider,et al.  Concurrent and Real-time Systems: The CSP Approach , 1999 .

[104]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[105]  Wang Yi,et al.  Verification of an Audio Protocol with Bus Collision Using UPPAAL , 1996, CAV.

[106]  Alexandre David,et al.  From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata , 2001 .

[107]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[108]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[109]  Nicolas Halbwachs,et al.  Détermination automatique de relations linéaires vérifiées par les variables d'un programme , 1979 .

[110]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[111]  Farn Wang,et al.  Reachability solution characterization of parametric real-time systems , 2004, Theor. Comput. Sci..

[112]  Farn Wang,et al.  Parametric Optimization of Open Real-Time Systems , 2001, SAS.

[113]  Pao-Ann Hsiung,et al.  Efficient and User-Friendly Verification , 2002, IEEE Trans. Computers.

[114]  Farn Wang,et al.  Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram , 2001, FORTE.

[115]  Shmuel Katz,et al.  Saving Space by Fully Exploiting Invisible Transitions , 1999, Formal Methods Syst. Des..

[116]  Bruce Powel Douglass.  Real-Time UML , 2002, FTRTFT.

[117]  Robert K. Brayton,et al.  Verifying Abstractions of Timed Systems , 1996, CONCUR.

[118]  Kim G. Larsen,et al.  Exact Acceleration of Real-Time Model Checking , 2002, Theory and Practice of Timed Systems @ ETAPS.

[119]  Robert E. Shostak,et al.  On the SUP-INF Method for Proving Presburger Formulas , 1977, JACM.

[120]  Doron A. Peled,et al.  Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..

[121]  Mark Lawford,et al.  Equivalence preserving transformations for timed transition models , 1995 .

[122]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[123]  Thomas A. Henzinger,et al.  Parametric real-time reasoning , 1993, STOC.

[124]  Thomas A. Henzinger,et al.  An interleaving model for real-time , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[125]  Howard Wong-Toi,et al.  Symbolic approximations for verifying real-time systems , 1995 .

[126]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[127]  Monica Brockmeyer,et al.  A flexible, extensible simulation environment for testing real-time specifications , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[128]  Eugene W. Stark,et al.  A Proof Technique for Rely/Guarantee Properties , 1985, FSTTCS.

[129]  E. Clarke,et al.  Symbolic Model Checking : IO * ’ States and Beyond * , 1992 .

[130]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[131]  Rajeev Alur,et al.  Modular refinement of hierarchic reactive machines , 2004, TOPL.

[132]  Amir Pnueli,et al.  A Compositional Real-Time Semantics of STATEMATE Designs , 1997, COMPOS.

[133]  Pao-Ann Hsiung,et al.  Automatic verification on the large , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[134]  Joseph Sifakis,et al.  Compiling Real-Time Specifications into Extended Automata , 1992, IEEE Trans. Software Eng..

[135]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[136]  Farn Wang,et al.  Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems , 2000, TACAS.

[137]  W. Wonham,et al.  The supervisory control of timed discrete-event systems , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[138]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[139]  Jan A. Bergstra,et al.  Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time , 1997, Fundam. Informaticae.

[140]  Nancy A. Lynch,et al.  Forward and backward simulations, part II: timing-based systems , 1993 .

[141]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[142]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[143]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[144]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[145]  Farn Wang,et al.  Distributed real-time system specification and verification in APTL , 1993, TSEM.

[146]  Sriram K. Rajamani,et al.  SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft , 2004, IFM.

[147]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[148]  Joël Ouaknine,et al.  State/Event-Based Software Model Checking , 2004, IFM.

[149]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[150]  Jim Davies,et al.  A Brief History of Timed CSP , 1995, Theor. Comput. Sci..

[151]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[152]  Amir Pnueli,et al.  Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[153]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[154]  Amir Pnueli,et al.  Symbolic Controller Synthesis for Discrete and Timed Systems , 1994, Hybrid Systems.

[155]  Natarajan Shankar,et al.  On Shostak's Decision Procedure for Combinations of Theories , 1996, CADE.

[156]  Ahmed Bouajjani,et al.  Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems , 2000, CAV.

[157]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[158]  Farnam Jahanian,et al.  Verifying properties of systems with variable timing constraints , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[159]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[160]  Robert E. Shostak,et al.  An algorithm for reasoning about equality , 1977, CACM.

[161]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[162]  Jozef Hooman.  Compositional Verification of Real-Time Applications , 1997, COMPOS.

[163]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[164]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[165]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[166]  Thomas A. Henzinger,et al.  MOCHA: Modularity in Model Checking , 1998, CAV.

[167]  Carlo Ghezzi,et al.  A Unified High-Level Petri Net Formalism for Time-Critical Systems , 1991, IEEE Trans. Software Eng..

[168]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[169]  Farn Wang,et al.  Symbolic Model Checking for Distributed Real-Time Systems , 1993, FME.

[170]  Martín Abadi,et al.  Conjoining specifications , 1995, TOPL.

[171]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[172]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[173]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[174]  Judi Romijn.  A Timed Verification of the IEEE 1394 Leader Election Protocol , 2001, Formal Methods Syst. Des..

[175]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[176]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[177]  Eugene Asarin,et al.  As Soon as Possible: Time Optimal Control for Timed Automata , 1999, HSCC.

[178]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[179]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[180]  Myla Archer,et al.  TAME: A Specialized Specification and Verification System for Timed Automata , 1996 .

[181]  Slawomir Lasota.  Decidability of Strong Bisimilarity for Timed BPP , 2002, CONCUR.

[182]  Andrea Maggiolo-Schettini,et al.  Time-Based Expressivity of Time Petri Nets for System Specification , 1999, Theor. Comput. Sci..

[183]  Jianping Wu,et al.  Formal Methods for Protocol Engineering and Distributed Systems , 1999, IFIP Advances in Information and Communication Technology.

[184]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[185]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[186]  Nancy A. Lynch,et al.  Verifying timing properties of concurrent algorithms , 1994, FORTE.

[187]  Vijay Kumar,et al.  Hierarchical modeling and analysis of embedded systems , 2003, Proc. IEEE.

[188]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[189]  Jonathan S. Ostroff,et al.  Model Reduction of Modules for State-Even Temporal Logics , 1996, FORTE.

[190]  Mariëlle Stoelinga,et al.  Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k , 2001, International Journal on Software Tools for Technology Transfer.

[191]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[192]  Marius Minea,et al.  Partial Order Reduction for Model Checking of Timed Automata , 1999, CONCUR.

[193]  François Laroussinie,et al.  Model-Checking for Hybrid Systems by Quotienting and Constraints Solving , 2000, CAV.

[194]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[195]  Doron A. Peled,et al.  Static Partial Order Reduction , 1998, TACAS.

[196]  Ofer Strichman,et al.  Deciding Separation Formulas with SAT , 2002, CAV.

[197]  Wang Yi,et al.  Axiomatising timed automata , 2002, Acta Informatica.

[198]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[199]  Kim G. Larsen,et al.  CMC: A Tool for Compositional Model-Checking of Real-Time Systems , 1998, FORTE.

[200]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[201]  Jan Friso Groote,et al.  The Propositional Formula Checker HeerHugo , 2000, Journal of Automated Reasoning.

[202]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[203]  Farn Wang.  Parametric Timing Analysis for Real-Time Systems , 1996, Inf. Comput..

[204]  Ekkart Kindler,et al.  ESTL: A Temporal Logic for Events and States , 1998, ICATPN.

[205]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[206]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[207]  Nancy A. Lynch,et al.  Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[208]  Joost-Pieter Katoen,et al.  Formal Methods for Real-Time and Probabilistic Systems , 1999, Lecture Notes in Computer Science.

[209]  Felice Balarin,et al.  Approximate reachability analysis of timed automata , 1996, 17th IEEE Real-Time Systems Symposium.

[210]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[211]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[212]  Stavros Tripakis,et al.  Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..

[213]  Rüdiger Valk,et al.  Petri nets for systems engineering - a guide to modeling, verification, and applications , 2010 .

[214]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[215]  Farn Wang.  Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures , 2004, CAV.

[216]  Paul C. Clements,et al.  Modechart Toolset User's Guide , 1994 .

[217]  Farn Wang,et al.  Parametric Analysis of Computer Systems , 1997, Formal Methods Syst. Des..

[218]  Frits W. Vaandrager,et al.  Linear parametric model checking of timed automata , 2001, J. Log. Algebraic Methods Program..

[219]  Thomas Stauner,et al.  Using HYTECH to Verify an Automative Control System , 1997, HART.

[220]  Jonathan S. Ostroff,et al.  Formal methods for the specification and design of real-time safety critical systems , 1992, J. Syst. Softw..

[221]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[222]  Ernst-Rüdiger Olderog,et al.  Transformational design of real-time systems Part I: From requirements to program specifications , 1999, Acta Informatica.

[223]  Robert E. Shostak,et al.  Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.

[224]  Myla Archer,et al.  TAME: Using PVS strategies for special-purpose theorem proving , 2001, Annals of Mathematics and Artificial Intelligence.

[225]  Henrik Reif Andersen,et al.  Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams , 2001, SMC@FLoC.

[226]  Thomas A. Henzinger,et al.  Reactive Modules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[227]  Rajeev Alur,et al.  Parametric temporal logic for “model measuring” , 2001, TOCL.

[228]  Parosh Aziz Abdulla,et al.  Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol , 1999, TACAS.

[229]  Guy Leduc,et al.  An Introduction to ET-LOTOS for the Description of Time-Sensitive Systems , 1997, Comput. Networks ISDN Syst..

[230]  Farn Wang,et al.  Symbolic model checking for event-driven real-time systems , 1997, TOPL.

[231]  Farn Wang,et al.  Symbolic simulation of industrial real-time and embedded systems -experiments with the bluetooth baseband communication protocol , 2005, J. Embed. Comput..