Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 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

A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets (2401.01884v3)

Published 3 Jan 2024 in cs.LO

Abstract: This paper presents a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs), a flexible model of timed systems where parameters are allowed in firing bounds. We prove that our semantics is bisimilar to the "standard" semantics of PITPNs. This allows us to use the rewriting logic tool Maude, combined with SMT solving, to provide sound and complete formal analyses for PITPNs. We develop and implement a new general folding approach for symbolic reachability, so that Maude-with-SMT reachability analysis terminates whenever the parametric state-class graph of the PITPN is finite. Our work opens up the possibility of using the many formal analysis capabilities of Maude -- including full LTL model checking, analysis with user-defined analysis strategies, and even statistical model checking -- for such nets. We illustrate this by explaining how almost all formal analysis and parameter synthesis methods supported by the state-of-the-art PITPN tool Romeo can be performed using Maude with SMT. In addition, we also support analysis and parameter synthesis from parametric initial markings, as well as full LTL model checking and analysis with user-defined execution strategies. Experiments show that our methods outperform Romeo in many cases.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (61)
  1. Merlin PM. A study of the recoverability of computing systems. Ph.D. thesis, University of California, Irvine, CA, USA, 1974.
  2. Vernadat F, Berthomieu B. State Space Abstractions for Time Petri Nets. In: Son SH, Lee I, Leung JY (eds.), Handbook of Real-Time and Embedded Systems. Chapman and Hall/CRC, 2007.
  3. Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph. In: Formal Modeling and Analysis of Timed Systems (FORMATS 2008), volume 5215 of LNCS. Springer, 2008 pp. 280–294.
  4. Diagnosis Using Unfoldings of Parametric Time Petri Nets. In: Formal Modeling and Analysis of Timed Systems (FORMATS 2010), volume 6246 of LNCS. Springer, 2010 pp. 137–151.
  5. Precise Robustness Analysis of Time Petri Nets with Inhibitor Arcs. In: Formal Modeling and Analysis of Timed Systems (FORMATS’13), volume 8053 of LNCS. Springer, 2013 pp. 1–15.
  6. Cost Problems for Parametric Time Petri Nets. Fundam. Informaticae, 2021. 183(1-2):97–123.
  7. Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2009), volume 5505 of LNCS. Springer, 2009 pp. 54–57.
  8. Analyzing resilience properties in oscillatory biological systems using parametric model checking. Biosystems, 2016. 149:50–58.
  9. Applying Parametric Model-Checking Techniques for Reusing Real-Time Critical Systems. In: Formal Techniques for Safety-Critical Systems (FTSCS 2016), volume 694 of Communications in Computer and Information Science. Springer, 2017 pp. 129–144.
  10. Integrated Model-Checking for the Design of Safe and Efficient Distributed Software Commissioning. In: Integrated Formal Methods (IFM 2019), volume 11918 of LNCS. Springer, Cham, 2019 pp. 120–137.
  11. Meseguer J. Conditional Rewriting Logic as a Unified Model of Concurrency. Theor. Comput. Sci., 1992. 96(1):73–155.
  12. Meseguer J. Twenty years of rewriting logic. J. Log. Algebraic Methods Program., 2012. 81(7-8):721–781.
  13. All About Maude – A High-Performance Logical Framework, volume 4350 of LNCS. Springer, 2007.
  14. Ölveczky PC, Meseguer J. The Real-Time Maude Tool. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2008), volume 4963 of LNCS. Springer, 2008 pp. 332–336.
  15. Ölveczky PC. Real-Time Maude and Its Applications. In: Rewriting Logic and Its Applications (WRLA 2014), volume 8663 of LNCS. Springer, 2014 pp. 42–79.
  16. Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. Formal Methods Syst. Des., 2006. 29(3):253–293.
  17. Lien E, Ölveczky PC. Formal Modeling and Analysis of an IETF Multicast Protocol. In: Seventh IEEE International Conference on Software Engineering and Formal Methods (SEFM 2009). IEEE Computer Society, 2009 pp. 273–282.
  18. Ölveczky PC, Thorvaldsen S. Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude. Theor. Comput. Sci., 2009. 410(2-3):254–280.
  19. Ölveczky PC, Caccamo M. Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude. In: Fundamental Approaches to Software Engineering (FASE 2006), volume 3922 of LNCS. Springer, 2006 pp. 357–372.
  20. Designing and verifying distributed cyber-physical systems using Multirate PALS: An airplane turning control system case study. Sci. Comput. Program., 2015. 103:13–50.
  21. Grov J, Ölveczky PC. Formal Modeling and Analysis of Google’s Megastore in Real-Time Maude. In: Specification, Algebra, and Software – Essays Dedicated to Kokichi Futatsugi, volume 8373 of LNCS. Springer, 2014 pp. 494–519.
  22. Grov J, Ölveczky PC. Increasing Consistency in Multi-site Data Stores: Megastore-CGC and Its Formal Analysis. In: Software Engineering and Formal Methods (SEFM 2014), volume 8702 of LNCS. Springer, 2014 pp. 159–174.
  23. Modeling and analyzing mobile ad hoc networks in Real-Time Maude. J. Log. Algebraic Methods Program., 2016. 85(1):34–66.
  24. Formal modeling and analysis of safety-critical human multitasking. Innov. Syst. Softw. Eng., 2019. 15(3-4):169–190.
  25. Formal Semantics and Analysis of Behavioral AADL Models in Real-Time Maude. In: Formal Techniques for Distributed Systems, Joint 12th IFIP WG 6.1 International Conference, FMOODS 2010 and 30th IFIP WG 6.1 FORTE 2010, volume 6117 of LNCS. Springer, 2010 pp. 47–62.
  26. Formal Specification and Analysis of Timing Properties in Software Systems. In: Fundamental Approaches to Software Engineering (FASE 2009), volume 5503 of LNCS. Springer, 2009 pp. 262–277.
  27. Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude. Sci. Comput. Program., 2012. 77(12):1235–1271.
  28. The SynchAADL2Maude Tool. In: Fundamental Approaches to Software Engineering (FASE 2012), volume 7212 of LNCS. Springer, 2012 pp. 59–62.
  29. Ölveczky PC. Semantics, Simulation, and Formal Analysis of Modeling Languages for Embedded Systems in Real-Time Maude. In: Formal Modeling: Actors, Open Systems, Biological Systems – Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday, volume 7000 of LNCS, pp. 368–402. Springer, 2011.
  30. Ölveczky PC, Meseguer J. Abstraction and Completeness for Real-Time Maude. In: 6th International Workshop on Rewriting Logic and its Applications (WRLA 2006), volume 174 of Electronic Notes in Theoretical Computer Science. Elsevier, 2006 pp. 5–27.
  31. Yu G, Bae K. Maude-SE: a Tight Integration of Maude and SMT Solvers. In: Preliminary proceedings of WRLA@ETAPS. 2020 pp. 220–232.
  32. Ölveczky PC, Meseguer J. Semantics and pragmatics of Real-Time Maude. High. Order Symb. Comput., 2007. 20(1-2):161–196.
  33. Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata. In: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2022). ACM, 2022 pp. 3–15.
  34. Symbolic Analysis and Parameter Synthesis for Networks of Parametric Timed Automata with Global Variables using Maude and SMT Solving. Science of Computer Programming, 2024. 233.
  35. Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving. In: Application and Theory of Petri Nets and Concurrency (PETRI NETS 2023), volume 13929 of LNCS. Springer, 2023 pp. 369–392.
  36. PITPN2Maude, 2024. URL https://depot.lipn.univ-paris13.fr/real-time-maude/pitpn2maude-journal.
  37. Model Checking. MIT Press, 2001.
  38. Rewriting modulo SMT and open system analysis. J. Log. Algebraic Methods Program., 2017. 86(1):269–297.
  39. A State Class Based Controller Synthesis Approach for Time Petri Nets. In: Application and Theory of Petri Nets and Concurrency (PETRI NETS 2023), volume 13929 of LNCS. Springer, 2023 pp. 393–414.
  40. Bae K, Rocha C. Symbolic state space reduction with guarded terms for rewriting modulo SMT. Sci. Comput. Program., 2019. 178:20–42.
  41. Rewriting Logic as a Unifying Framework for Petri Nets. In: Unifying Petri Nets, Advances in Petri Nets, volume 2128 of Lecture Notes in Computer Science. Springer, 2001 pp. 250–303.
  42. Wang J. Time Petri Nets. In: Timed Petri Nets: Theory and Application, pp. 63–123. Springer, 1998.
  43. Meseguer J. Generalized rewrite theories, coherence completion, and symbolic methods. J. Log. Algebraic Methods Program., 2020. 110.
  44. Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. In: Rewriting Techniques and Applications (RTA 2013), volume 21 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013 pp. 81–96.
  45. Dantzig G, Thapa M. Linear Programming 1: Introduction. Springer Series in Operations Research and Financial Engineering. Springer New York, 2006. ISBN 9780387226330.
  46. Parametric Model-Checking of Stopwatch Petri Nets. J. Univers. Comput. Sci., 2009. 15(17):3273–3304.
  47. Maude Manual (Version 3.3.1). SRI International, 2023. Available at http://maude.cs.illinois.edu.
  48. Roux OH, Lime D. Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation. In: Cortadella J, Reisig W (eds.), Applications and Theory of Petri Nets 2004, 25th International Conference, ICATPN 2004, volume 3099 of LNCS. Springer, 2004 pp. 371–390.
  49. Meseguer J, Montanari U. Petri Nets Are Monoids. Information and Computation, 1990. 88(2):105–155.
  50. Ölveczky PC, Meseguer J. Specification of real-time and hybrid systems in rewriting logic. Theor. Comput. Sci., 2002. 285(2):359–405.
  51. Capra L. Rewriting Logic and Petri Nets: A Natural Model for Reconfigurable Distributed Systems. In: Distributed Computing and Intelligent Technology (ICDCIT 2022), volume 13145 of LNCS. Springer, 2022 pp. 140–156.
  52. Capra L. Canonization of Reconfigurable PT Nets in Maude. In: Reachability Problems (RP 2022), volume 13608 of LNCS. Springer, 2022 pp. 160–177.
  53. Padberg J, Schulz A. Model Checking Reconfigurable Petri Nets with Maude. In: 9th International Conference on Graph Transformation (ICGT 2016), volume 9761 of LNCS. Springer, 2016 pp. 54–70.
  54. SysVeritas: A Framework for Verifying IOPT Nets and Execution Semantics within Embedded Systems Design. In: Technological Innovation for Sustainability - Second IFIP WG 5.5/SOCOLNET Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS 2011), volume 349 of IFIP Advances in Information and Communication Technology. Springer, 2011 pp. 256–265.
  55. Symbolic Analysis by Using Folding Narrowing with Irreducibility and SMT Constraints. In: 9th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2023). ACM, 2023 pp. 14–25.
  56. Bounded Model Checking of PLC ST Programs using Rewriting Modulo SMT. In: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2022). ACM, 2022 pp. 56–67.
  57. An extension of HybridSynchAADL and its application to collaborating autonomous UAVs. In: Leveraging Applications of Formal Methods, Verification and Validation. Adaptation and Learning (ISoLA 2022), volume 13703 of LNCS. Springer, 2022 pp. 47–64.
  58. Modeling and formal analysis of virtually synchronous cyber-physical systems in AADL. International Journal on Software Tools for Technology Transfer, 2022. 24(6):911–948.
  59. HybridSynchAADL: Modeling and Formal Analysis of Virtually Synchronous CPSs in AADL. In: Computer Aided Verification (CAV 2021), volume 12759 of LNCS. Springer, 2021 pp. 491–504.
  60. Nigam V, Talcott CL. Automating Safety Proofs About Cyber-Physical Systems Using Rewriting Modulo SMT. In: Rewriting Logic and Its Applications (WRLA 2022), volume 13252 of LNCS. Springer, 2022 pp. 212–229.
  61. Bae K, Rocha C. Guarded terms for rewriting modulo SMT. In: International Conference on Formal Aspects of Component Software (FACS 2017). Springer, 2017 pp. 78–97.

Summary

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

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