From Qualitative to Quantitative Analysis of Timed Systems

[1]  Slawomir Lasota,et al.  Alternating timed automata , 2005, TOCL.

[2]  Rajeev Alur,et al.  Perturbed Timed Automata , 2005, HSCC.

[3]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4]  Joël Ouaknine,et al.  On the decidability of metric temporal logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[5]  Mark Reynolds.  The complexity of temporal logic over the reals , 2010, Ann. Pure Appl. Log..

[6]  Véronique Bruyère,et al.  Model-Checking for Weighted Timed Automata , 2004, FORMATS/FTRTFT.

[7]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[8]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

[9]  Wang Yi,et al.  UPPAAL 4.0 , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[10]  Marcin Jurdzinski,et al.  Comparing Timed C/E Systems with Timed Automata , 1996 .

[11]  Kim G. Larsen,et al.  Staying Alive as Cheaply as Possible , 2004, HSCC.

[12]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[13]  Thomas A. Henzinger,et al.  Back to the future: towards a theory of timed regular languages , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[14]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[15]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[16]  Kim G. Larsen,et al.  Optimal infinite scheduling for multi-priced timed automata , 2008, Formal Methods Syst. Des..

[17]  Joost-Pieter Katoen,et al.  A theory of stochastic systems part I: Stochastic automata , 2005, Inf. Comput..

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

[19]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[20]  Supratik Mukhopadhyay,et al.  Optimal-Reachability and Control for Acyclic Weighted Timed Automata , 2002, IFIP TCS.

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

[22]  Patricia Bouyer,et al.  Robust Analysis of Timed Automata via Channel Machines , 2008, FoSSaCS.

[23]  Holger Hermanns,et al.  Motor: The MoDeST Tool Environment , 2007 .

[24]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[25]  Kim G. Larsen,et al.  The power of reachability testing for timed automata , 1998, Theor. Comput. Sci..

[26]  Stephan Merz,et al.  Model Checking , 2000 .

[27]  Patricia Bouyer,et al.  Timed Petri nets and timed automata: On the discriminating power of zeno sequences , 2006, Inf. Comput..

[28]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[29]  Catalin Dima,et al.  Dynamical Properties of Timed Automata Revisited , 2007, FORMATS.

[30]  Christel Baier,et al.  Probabilistic and Topological Semantics for Timed Automata , 2007, FSTTCS.

[31]  S. Shankar Sastry,et al.  O-Minimal Hybrid Systems , 2000, Math. Control. Signals Syst..

[32]  Holger Hermanns,et al.  MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems , 2006, IEEE Transactions on Software Engineering.

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

[34]  Patricia Bouyer,et al.  On Conciseness of Extensions of Timed Automata , 2005, J. Autom. Lang. Comb..

[35]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[36]  Nicolas Markey,et al.  Robustness and Implementability of Timed Automata , 2004, FORMATS/FTRTFT.

[37]  Véronique Bruyère,et al.  On the optimal reachability problem , 2006 .

[38]  Alain Finkel,et al.  Decidability of the termination problem for completely specified protocols , 1994, Distributed Computing.

[39]  Moshe Y. Vardi.  Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.

[40]  Philippe Schnoebelen,et al.  Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

[41]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[42]  Yoram Hirshfeld,et al.  Logics for Real Time: Decidability and Complexity , 2004, Fundam. Informaticae.

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

[44]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[45]  Marta Z. Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Timed Automata , 2000, CONCUR.

[46]  Deepak D'Souza,et al.  On the expressiveness of MTL in the pointwise and continuous semantics , 2007, International Journal on Software Tools for Technology Transfer.

[47]  Thomas A. Henzinger,et al.  It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.

[48]  Philippe Schnoebelen,et al.  On Termination for Faulty Channel Machines , 2008, STACS.

[49]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[50]  Nicolas Markey,et al.  Robust safety of timed automata , 2008, Formal Methods Syst. Des..

[51]  Thomas A. Henzinger,et al.  Robust Timed Automata , 1997, HART.

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

[53]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[54]  Thomas A. Henzinger,et al.  Discrete-Time Control for Rectangular Hybrid Automata , 1997, Theor. Comput. Sci..

[55]  Eliminating past operators in Metric Temporal Logic , 2006 .

[56]  Holger Hermanns,et al.  A tool for model-checking Markov chains , 2003, International Journal on Software Tools for Technology Transfer.

[57]  Alexandre David.  Merging {DBMs} Efficiently , 2005 .

[58]  Patricia Bouyer,et al.  Costs Are Expensive! , 2007, FORMATS.

[59]  Patricia Bouyer,et al.  Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..

[60]  M. Kwiatkowska,et al.  PRISM 2.0: a tool for probabilistic model checking , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

[61]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

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

[63]  Parosh Aziz Abdulla,et al.  R-Automata , 2008, CONCUR.

[64]  Conrado Daws,et al.  Symbolic Robustness Analysis of Timed Automata , 2006, FORMATS.

[65]  Eugene Asarin,et al.  Scheduling with timed automata , 2006, Theor. Comput. Sci..

[66]  Daniele Varacca,et al.  Temporal Logics and Model Checking for Fairly Correct Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[67]  Parosh Aziz Abdulla,et al.  Verifying Networks of Timed Processes (Extended Abstract) , 1998, TACAS.

[68]  Matt Brown,et al.  Invited talk , 2007 .

[69]  Patricia Bouyer,et al.  On the Expressiveness of TPTL and MTL , 2005, FSTTCS.

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

[71]  Satoru Miyano,et al.  Alternating Finite Automata on omega-Words , 1984, CAAP.

[72]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[73]  Mario Bravetti,et al.  The theory of interactive generalized semi-Markov processes , 2002, Theor. Comput. Sci..

[74]  Marcin Jurdzinski,et al.  Average-Time Games on Timed Automata , 2008, FSTTCS.

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

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

[77]  Christel Baier,et al.  Model checking meets performance evaluation , 2005, PERV.

[78]  Moshe Y. Vardi.  Branching vs. Linear Time: Final Showdown , 2001, TACAS.

[79]  Joël Ouaknine,et al.  On Metric Temporal Logic and Faulty Turing Machines , 2006, FoSSaCS.

[80]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

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

[82]  Kim G. Larsen,et al.  Discount-Optimal Infinite Runs in Priced Timed Automata , 2009, INFINITY.

[83]  Kim G. Larsen,et al.  Model Checking One-clock Priced Timed Automata , 2007, Log. Methods Comput. Sci..

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

[85]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[86]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[87]  Stavros Tripakis,et al.  Implementation of Timed Automata: An Issue of Semantics or Modeling? , 2005, FORMATS.

[88]  Deepak D'Souza,et al.  On the Expressiveness of MTL with Past Operators , 2006, FORMATS.

[89]  Antoine Petit,et al.  Analysing the PGM protocol with UPPAAL , 2004 .

[90]  David E. Muller,et al.  Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[91]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[92]  Wang Yi,et al.  Clock Difference Diagrams , 1998, Nord. J. Comput..

[93]  Wa Halang,et al.  REAL-TIME SYSTEMS .2. , 1989 .

[94]  Patricia Bouyer,et al.  Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems , 2005, FORMATS.

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

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

[97]  Oded Maler,et al.  Job-Shop Scheduling Using Timed Automata , 2001, CAV.

[98]  Paul Gastin,et al.  Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.

[99]  Christel Baier,et al.  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[100]  Philippe Schnoebelen,et al.  The Ordinal Recursive Complexity of Lossy Channel Systems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[101]  Kim G. Larsen,et al.  Optimal scheduling using priced timed automata , 2005, PERV.

[102]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

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

[104]  Jean-François Raskin,et al.  An Introduction to Hybrid Automata , 2005, Handbook of Networked and Embedded Control Systems.

[105]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[106]  Nicolas Markey,et al.  Robust Model-Checking of Timed Automata , 2010 .

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

[108]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[109]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[110]  Joël Ouaknine,et al.  The Cost of Punctuality , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[111]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

[112]  Patricia Bouyer,et al.  Controller Synthesis for MTL Specifications , 2006, CONCUR.

[113]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[114]  Patricia Bouyer,et al.  A New Modality for Almost Everywhere Properties in Timed Automata , 2005, CONCUR.

[115]  Prakash Panangaden,et al.  Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes , 2003, J. Log. Algebraic Methods Program..

[116]  Kim G. Larsen,et al.  Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL , 1997, Proceedings Real-Time Systems Symposium.

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

[118]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[119]  Fabrice Chevalier.  Logiques pour les systèmes temporisés : contrôle et expressivité. (Logics for timed systems : control and expressivity) , 2007 .

[120]  Pierre-Yves Schobbens,et al.  The Regular Real-Time Languages , 1998, ICALP.

[121]  Kim G. Larsen,et al.  As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata , 2001, CAV.

[122]  Benedikt Bollig,et al.  Distributed Timed Automata with Independently Evolving Clocks , 2008, CONCUR.

[123]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[124]  Kim G. Larsen,et al.  On using priced timed automata to achieve optimal scheduling , 2006, Formal Methods Syst. Des..

[125]  Yoram Hirshfeld,et al.  Timer formulas and decidable metric temporal logic , 2005, Inf. Comput..

[126]  Martin Fränzle,et al.  A Symbolic Decision Procedure for Robust Safety of Timed Systems , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[127]  Patricia Bouyer,et al.  Improved undecidability results on weighted timed automata , 2006, Inf. Process. Lett..

[128]  Patricia Bouyer,et al.  Control in o-minimal Hybrid Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[129]  Jean-François Raskin,et al.  Almost ASAP semantics: from timed models to timed implementations , 2004, Formal Aspects of Computing.

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

[131]  Johan Bengtsson,et al.  Clocks, DBMS and States in Timed Systems , 2002 .

[132]  Rajeev Alur,et al.  Optimal Reachability for Weighted Timed Games , 2004, ICALP.

[133]  Kim G. Larsen,et al.  Lower and upper bounds in zone-based abstractions of timed automata , 2004, International Journal on Software Tools for Technology Transfer.

[134]  Kim G. Larsen,et al.  Priced Timed Automata: Algorithms and Applications , 2004, FMCO.

[135]  Patricia Bouyer,et al.  Timed Unfoldings for Networks of Timed Automata , 2006, ATVA.

[136]  Nathalie Bertrand,et al.  Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[137]  Patricia Bouyer,et al.  Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! , 2007, LFCS.

[138]  Patricia Bouyer,et al.  Extended Timed Automata and Time Petri Nets , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[139]  Mihalis Yannakakis,et al.  Minimum and maximum delay problems in real-time systems , 1991, Formal Methods Syst. Des..

[140]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[141]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[142]  Luca Aceto,et al.  Is your model checker on time? On the complexity of model checking for timed modal logics , 1999, J. Log. Algebraic Methods Program..

[143]  Kim G. Larsen,et al.  Guided Controller Synthesis for Climate Controller Using Uppaal Tiga , 2007, FORMATS.

[144]  Pierre Wolper,et al.  Constructing Automata from Temporal Logic Formulas: A Tutorial , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

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

[146]  Moshe Y. Vardi,et al.  Branching vs. Linear Time: Semantical Perspective , 2007, ATVA.

[147]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[148]  Kim G. Larsen,et al.  Synthesis of Optimal Strategies Using HyTech , 2005, GDV@CAV.

[149]  Joël Ouaknine,et al.  On the decidability and complexity of Metric Temporal Logic over finite words , 2007, Log. Methods Comput. Sci..

[150]  Jean-François Raskin,et al.  Almost ASAP semantics: from timed models to timed implementations , 2005, Formal Aspects of Computing.

[151]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[152]  John C. Oxtoby.  7. THE BANACH-MAZUR GAME AND BANACH CATEGORY THEOREM , 1958 .

[153]  Joël Ouaknine,et al.  On Expressiveness and Complexity in Real-Time Model Checking , 2008, ICALP.

[154]  Robert K. Brayton,et al.  Model-checking continuous-time Markov chains , 2000, TOCL.

[155]  Kim Guldstrand Larsen,et al.  Almost Optimal Strategies in One Clock Priced Timed Automata , 2007 .

[156]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[157]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[158]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[159]  Anuj Puri.  Dynamical Properties of Timed Automata , 2000, Discret. Event Dyn. Syst..

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

[161]  Joël Ouaknine,et al.  Safety Metric Temporal Logic Is Fully Decidable , 2006, TACAS.

[162]  Stavros Tripakis,et al.  Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.

[163]  R. Alur.  Techniques for automatic verification of real-time systems , 1991 .

[164]  Yoram Hirshfeld,et al.  Expressiveness of Metric Modalities for Continuous Time , 2006, CSR.

[165]  Patricia Bouyer,et al.  Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets , 2008, FORMATS.

[166]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[167]  Christel Baier,et al.  A Probabilistic Semantics for Timed Automata , 2008 .

[168]  Kim G. Larsen,et al.  Optimal Strategies in Priced Timed Game Automata , 2004, FSTTCS.

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

[170]  Stavros Tripakis,et al.  KRONOS: A Model-Checking Tool for Real-Time Systems (Tool-Presentation for FTRTFT '98) , 1998, FTRTFT.

[171]  Patricia Bouyer,et al.  Timed Temporal Logics for Abstracting Transient States , 2006, ATVA.

[172]  Véronique Bruyère,et al.  On Optimal Timed Strategies , 2005, FORMATS.

[173]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[174]  Mariëlle Stoelinga.  Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol , 2003, Formal Aspects of Computing.