Model measuring for discrete and hybrid systems

[1]  Danny Dolev,et al.  On the Security of Public Key Protocols (Extended Abstract) , 1981, FOCS.

[2]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Orna Grumberg,et al.  Model checking and modular verification , 1991, TOPL.

[4]  Diederich Hinrichsen,et al.  Stability radii of linear discrete‐time systems and symplectic pencils , 1991 .

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

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

[7]  Uri Zwick,et al.  The Complexity of Mean Payoff Games , 1995, COCOON.

[8]  T. Henzinger.  The theory of hybrid automata , 1996, LICS 1996.

[9]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[10]  Orna Kupferman,et al.  Robust Satisfaction , 1999, CONCUR.

[11]  Georg Gottlob,et al.  Enhancing Model Checking in Verification by AI Techniques , 1999, Artif. Intell..

[12]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[13]  Joseph S. Miller.  Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata , 2000, HSCC.

[14]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[15]  Orna Kupferman,et al.  Coverage Metrics for Temporal Logic Model Checking , 2001, TACAS.

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

[17]  Mehryar Mohri,et al.  Semiring Frameworks and Algorithms for Shortest-Distance Problems , 2002, J. Autom. Lang. Comb..

[18]  Orna Kupferman,et al.  Vacuity detection in temporal model checking , 2003, International Journal on Software Tools for Technology Transfer.

[19]  Rajeev Alur,et al.  Decision Problems for Timed Automata: A Survey , 2004, SFM.

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

[21]  Ansuman Banerjee,et al.  Formal methods for analyzing the completeness of an assertion suite against a high-level fault model , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[22]  Krishnendu Chatterjee,et al.  Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[23]  Véronique Bruyère,et al.  On the optimal reachability problem of weighted timed automata , 2007, Formal Methods Syst. Des..

[24]  Sanjit A. Seshia,et al.  A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance , 2008, 2008 Formal Methods in Computer-Aided Design.

[25]  Sumit Kumar Jha,et al.  A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata , 2008, HSCC.

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

[27]  Krishnendu Chatterjee,et al.  Quantitative Languages , 2008, CSL.

[28]  Marcin Jurdzinski,et al.  Concavely-Priced Timed Automata , 2008, FORMATS.

[29]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[30]  George J. Pappas,et al.  Robustness of temporal logic specifications for continuous-time signals , 2009, Theor. Comput. Sci..

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

[32]  Oded Maler,et al.  Robust Satisfaction of Temporal Logic over Real-Valued Signals , 2010, FORMATS.

[33]  Thomas A. Henzinger.  From Boolean to quantitative notions of correctness , 2010, POPL '10.

[34]  Jan Otop.  E-unification with Constants vs. General E-unification , 2010, Journal of Automated Reasoning.

[35]  Rajeev Alur,et al.  Relating average and discounted costs for quantitative analysis of timed systems , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[36]  Krishnendu Chatterjee,et al.  Temporal Specifications with Accumulative Values , 2011, LICS.

[37]  Patricia Bouyer,et al.  Robust Model-Checking of Timed Automata via Pumping in Channel Machines , 2011, FORMATS.

[38]  Joël Ouaknine,et al.  On Reachability for Hybrid Automata over Bounded Time , 2011, ICALP.

[39]  Simulation distances , 2012, Theor. Comput. Sci..

[40]  Laurent Fribourg,et al.  Parametric Verification and Test Coverage for Hybrid Automata using the inverse Method , 2013, Int. J. Found. Comput. Sci..

[41]  Thomas A. Henzinger,et al.  From Model Checking to Model Measuring , 2013, CONCUR.

[42]  Jürgen Dingel,et al.  A survey of timed automata for the development of real-time systems , 2013, Comput. Sci. Rev..

[43]  Thomas A. Henzinger,et al.  Model measuring for hybrid systems , 2014, HSCC.

[44]  Krishnendu Chatterjee,et al.  Measuring and Synthesizing Systems in Probabilistic Environments , 2010, J. ACM.

[45]  Patricia Bouyer,et al.  Robust reachability in timed automata and games: A game-based approach , 2015, Theor. Comput. Sci..

[46]  Patricia Bouyer,et al.  On the optimal reachability problem in weighted timed automata and games , 2015, NCMA.

[47]  Thomas A. Henzinger,et al.  Lipschitz Robustness of Timed I/O Systems , 2016, VMCAI.