Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Timed Automata Robustness Analysis via Model Checking (2108.08018v4)

Published 18 Aug 2021 in cs.LO and cs.FL

Abstract: Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the exact timing constants are often uncertain during the design phase. Consequently, the designer is often able to build a TA with a correct structure, however, the timing constants need to be tuned to satisfy the specification. Moreover, even if the TA initially satisfies the specification, it can be the case that just a slight perturbation during the implementation causes a violation of the specification. Unfortunately, model-checking tools are usually not able to provide any reasonable guidance on how to fix the model in such situations. In this paper, we propose several concepts and techniques to cope with the above mentioned design phase issues when dealing with reachability and safety specifications.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (67)
  1. Repairing timed automata clock guards through abstraction and testing. In Dirk Beyer and Chantal Keller, editors, Tests and Proofs, pages 129–146, Cham, 2019. Springer International Publishing. doi:10.1007/978-3-030-31157-5_9.
  2. Synthèse de contraintes temporisées pour une architecture d’automatisation en réseau. Journal Européen des Systèmes Automatisés, 43, November 2009. doi:10.3166/jesa.43.1049-1064.
  3. A theory of timed automata. Theoretical computer science, 126(2):183–235, 1994. doi:10.1016/0304-3975(94)90010-8.
  4. Imitator 2.5: A tool for analyzing robustness in scheduling problems. In Dimitra Giannakopoulou and Dominique Méry, editors, Formal Methods, pages 33–36, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg. doi:10.1007/978-3-642-32759-9_6.
  5. Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. In Constantin Enea and Ruzica Piskac, editors, Verification, Model Checking, and Abstract Interpretation, pages 409–424, Cham, 2019. Springer International Publishing. doi:10.1007/978-3-030-11245-5_19.
  6. Offline timed pattern matching under uncertainty. In International Conference on Engineering of Complex Computer Systems, pages 10–20. IEEE Computer Society, 2018. doi:10.1109/ICECCS2018.2018.00010.
  7. Parametric verification: An introduction. Trans. Petri Nets Other Model. Concurr., 14:64–100, 2019. doi:10.1007/978-3-662-60651-3_3.
  8. Time for mutants — model-based mutation testing with timed automata. In Margus Veanes and Luca Viganò, editors, Tests and Proofs, pages 20–38, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg. doi:10.1007/978-3-642-38916-0_2.
  9. Reachability preservation based parameter synthesis for timed automata. In Klaus Havelund, Gerard Holzmann, and Rajeev Joshi, editors, NASA Formal Methods, pages 50–65, Cham, 2015. Springer International Publishing. doi:10.1007/978-3-319-17524-9_5.
  10. Rajeev Alur. Timed automata. In International Conference on Computer Aided Verification, pages 8–22. Springer, 1999. doi:10.1007/3-540-48683-6_3.
  11. Job-shop scheduling using timed automata. In Gérard Berry, Hubert Comon, and Alain Finkel, editors, International Conference on Computer Aided Verification, pages 478–492, Berlin, Heidelberg, 2001. Springer Berlin Heidelberg. doi:10.1007/3-540-44585-4_46.
  12. Étienne André. A benchmark library for parametric timed model checking. In Cyrille Artho and Peter Csaba Ölveczky, editors, Formal Techniques for Safety-Critical Systems, pages 75–83, Cham, 2019. Springer International Publishing. doi:10.1007/978-3-030-12988-0_5.
  13. Étienne André. What’s decidable about parametric timed automata? Int. J. Softw. Tools Technol. Transf., 21(2):203–219, April 2019. doi:10.1007/s10009-017-0467-0.
  14. Synthesis of timing parameters satisfying safety properties. In Giorgio Delzanno and Igor Potapov, editors, Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, volume 6945 of LNCS, pages 31–44. Springer, 2011. doi:10.1007/978-3-642-24288-5_5.
  15. Analysing sanity of requirements for avionics systems. Formal Aspects of Computing 28, pages 1–19, 2016. doi:10.1007/s00165-015-0348-9.
  16. LTL parameter synthesis of parametric timed automata. In Rocco De Nicola and Eva Kühn, editors, Software Engineering and Formal Methods, pages 172–187, Cham, 2016. Springer International Publishing. doi:10.1007/978-3-319-41591-8_12.
  17. On the optimal reachability problem of weighted timed automata. Formal Methods in System Design, 31:135–175, 2007. doi:10.1007/s10703-007-0035-4.
  18. Tunable online MUS/MSS enumeration. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 65 of LIPIcs, pages 50:1–50:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. doi:10.4230/LIPIcs.FSTTCS.2016.50.
  19. On clock-aware LTL parameter synthesis of timed automata. J. Log. Algebraic Methods Program., 99:114–142, 2018. doi:10.1016/j.jlamp.2018.05.004.
  20. Language emptiness of continuous-time parametric timed automata. In International Colloquium on Automata, Languages, and Programming, volume 9135 of LNCS, pages 69–81. Springer, 2015. doi:10.1007/978-3-662-47666-6_6.
  21. Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets. In LPAR, volume 57 of EPiC Series in Computing, pages 131–142. EasyChair, 2018. doi:10.29007/sxzb.
  22. Replication-guided enumeration of minimal unsatisfiable subsets. In International Conference on Principles and Practice of Constraint Programming, volume 12333 of LNCS, pages 37–54. Springer, 2020. doi:10.1007/978-3-030-58475-7_3.
  23. Rotation based MSS/MCS enumeration. In LPAR, volume 73 of EPiC Series in Computing, pages 120–137. EasyChair, 2020. doi:10.29007/8btb.
  24. Recursive online enumeration of all minimal unsatisfiable subsets. In International symposium on automated technology for verification and analysis, volume 11138 of LNCS, pages 143–159. Springer, 2018. doi:10.1007/978-3-030-01090-4_9.
  25. Uppaal 4.0. In Proceedings of the 3rd International Conference on the Quantitative Evaluation of Systems, QEST ’06, pages 125–126, Washington, DC, USA, 2006. IEEE Computer Society. doi:10.1109/QEST.2006.59.
  26. Jaroslav Bendík. Consistency checking in requirements analysis. In Proceedings of the 26th ACM SIGSOFT international symposium on software testing and analysis, pages 408–411. ACM, 2017. doi:10.1145/3092703.3098239.
  27. Jaroslav Bendík. Minimal Sets over a Monotone Predicate: Enumeration and Counting. PhD thesis, Masaryk University, 2021. URL: https://is.muni.cz/th/y4v8m/dissertationRevised.pdf.
  28. Online enumeration of all minimal inductive validity cores. In International Conference on Software Engineering and Formal Methods, volume 10886 of LNCS, pages 189–204. Springer, 2018. doi:10.1007/978-3-319-92970-5_12.
  29. Finding a collection of muses incrementally. In International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 9676 of LNCS, pages 35–44. Springer, 2016. doi:10.1007/978-3-319-33954-2_3.
  30. Robustness in timed automata. In Parosh Aziz Abdulla and Igor Potapov, editors, Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, volume 8169 of LNCS, pages 1–18. Springer, 2013. doi:10.1007/978-3-642-41036-9_1.
  31. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In International Workshop on Practical Aspects of Declarative Languages, pages 174–186. Springer, 2005. doi:10.1007/978-3-540-30557-6_14.
  32. Timed automata relaxation for reachability. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 12651 of LNCS, pages 291–310. Springer, 2021. doi:10.1007/978-3-030-72016-2_16.
  33. Parameterized reachability analysis of the IEEE 1394 root contention protocol using trex. 08 2001.
  34. Model-based framework for schedulability analysis using UPPAAL 4.1. In Model-based design for embedded systems, pages 117–144. 2009.
  35. Finding all minimal unsatisfiable subsets. In Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, pages 32–43. ACM, 2003. doi:10.1145/888251.888256.
  36. An automated system repair framework with signal temporal logic. Acta Informatica, pages 1–1, 2021. doi:10.1007/s00236-021-00403-z.
  37. The wireless fire alarm system: Ensuring conformance to industrial standards through formal verification. In Cliff Jones, Pekka Pihlajasaari, and Jun Sun, editors, Formal Methods, pages 658–672, Cham, 2014. Springer International Publishing. doi:10.1007/978-3-319-06410-9_44.
  38. A. Fehnker. Scheduling a steel plant with timed automata. In Proceedings Sixth International Conference on Real-Time Computing Systems and Applications, pages 280–286, 1999. doi:10.1109/RTCSA.1999.811256.
  39. Formal modeling and analysis of home care plans. In Xavier Franch, Aditya K. Ghose, Grace A. Lewis, and Sami Bhiri, editors, Service-Oriented Computing - 12th International Conference, volume 8831 of LNCS, pages 494–501. Springer, 2014. doi:10.1007/978-3-662-45391-9_41.
  40. Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking. In IFIP International Workshop on Software Technolgies for Embedded and Ubiquitous Systems, pages 263–272, 2007. doi:10.1007/978-3-540-75664-4_26.
  41. Efficient generation of all minimal inductive validity cores. In Formal Methods in Computer Aided Design, pages 31–38. IEEE, 2017. doi:10.23919/FMCAD.2017.8102238.
  42. Benchmarks for temporal logic requirements for automotive systems. In Goran Frehse and Matthias Althoff, editors, ARCH14-15. 1st and 2nd International Workshop on Applied veRification for Continuous and Hybrid Systems, volume 34 of EPiC Series in Computing, pages 25–30. EasyChair, 2015. doi:10.29007/xwrs.
  43. Some lessons from the hytech experience. In Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), volume 3, pages 2887–2892 vol.3, 2001.
  44. Linear parametric model checking of timed automata. In Tiziana Margaria and Wang Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, pages 189–203, Berlin, Heidelberg, 2001. Springer Berlin Heidelberg. doi:10.1007/3-540-45319-9_14.
  45. Quantified maximum satisfiability. Constraints An Int. J., 21(2):277–302, 2016. doi:10.1007/s10601-015-9195-9.
  46. On computing minimal independent support and its applications to sampling and counting. Constraints An Int. J., 21(1):41–58, 2016. doi:10.1007/s10601-015-9204-z.
  47. Smallest MUS extraction with minimal hitting set dualization. In International Conference on Principles and Practice of Constraint Programming, volume 9255 of LNCS, pages 173–182. Springer, 2015. doi:10.1007/978-3-319-23219-5_13.
  48. Integer parameter synthesis for timed automata. In Nir Piterman and Scott A. Smolka, editors, Tools and Algorithms for the Construction and Analysis of Systems, pages 401–415, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg. doi:10.1007/978-3-642-36742-7_28.
  49. Integer parameter synthesis for real-time systems. IEEE Transactions on Software Engineering, 41(5):445–461, 2015. doi:10.1109/TSE.2014.2357445.
  50. Closed-loop verification of medical devices with model abstraction and refinement. Int. J. Softw. Tools Technol. Transf., 16(2):191–213, April 2014. doi:10.1007/s10009-013-0289-7.
  51. Clock bound repair for timed systems. In Isil Dillig and Serdar Tasiran, editors, International Conference on Computer Aided Verification, pages 79–96, Cham, 2019. Springer International Publishing. doi:10.1007/978-3-030-25540-4_5.
  52. Synthesising robust and optimal parameters for cardiac pacemakers using symbolic and evolutionary computation techniques. In Alessandro Abate and David Šafránek, editors, Hybrid Systems Biology, pages 119–140, Cham, 2015. Springer International Publishing. doi:10.1007/978-3-319-26916-0_7.
  53. Bounded model checking for parametric timed automata. Trans. Petri Nets Other Model. Concurr., 5:141–159, 2010.
  54. A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints An Int. J., 14(4):415–442, 2009. doi:10.1007/s10601-008-9058-8.
  55. Fast, flexible MUS enumeration. Constraints, 21(2):223–250, 2016. doi:10.1007/s10601-015-9183-0.
  56. Romeo: A parametric model-checker for petri nets with stopwatches. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 5505 of LNCS, pages 54–57. Springer, 2009. doi:10.1007/978-3-642-00768-2_6.
  57. Time abstracted bisimulation: Implicit specifications and decidability. In International Conference on Mathematical Foundations of Programming Semantics, pages 160–176. Springer, 1993. doi:10.1006/inco.1997.2623.
  58. On computing minimal correction subsets. In Twenty-Third International Joint Conference on Artificial Intelligence, pages 615–622. IJCAI/AAAI, 2013.
  59. Minimal sets over monotone predicates in boolean formulae. In International Conference on Computer Aided Verification, volume 8044 of LNCS, pages 592–607. Springer, 2013. doi:10.1007/978-3-642-39799-8_39.
  60. Minimal sets on propositional formulae. problems and reductions. Artif. Intell., 252:22–50, 2017. doi:10.1016/j.artint.2017.07.005.
  61. Or-tools. URL: https://developers.google.com/optimization/.
  62. Ocan Sankur. Shrinktech: A tool for the robustness analysis of timed automata. In Natasha Sharygina and Helmut Veith, editors, International Conference on Computer Aided Verification, volume 8044 of LNCS, pages 1006–1012. Springer, 2013. doi:10.1007/978-3-642-39799-8_72.
  63. Shrinking timed automata. In Supratik Chakraborty and Amit Kumar, editors, Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 13 of LIPIcs, pages 90–102. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. doi:10.4230/LIPIcs.FSTTCS.2011.90.
  64. Exploring the duality in conflict-directed model-based diagnosis. In Twenty-Sixth AAAI Conference on Artificial Intelligence. AAAI Press, 2012.
  65. Emanuel Sperner. Ein satz über untermengen einer endlichen menge. Mathematische Zeitschrift, 27(1):544–548, 1928.
  66. Farn Wang. Formal verification of timed systems: a survey and perspective. Proceedings of the IEEE, 92(8):1283–1305, Aug 2004. doi:10.1109/JPROC.2004.831210.
  67. Robust safety of timed automata. Formal Methods Syst. Des., 33(1-3):45–84, 2008. doi:10.1007/s10703-008-0056-7.
Citations (6)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets