fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Publications
Last Updated
May 14, 2023

Table of contents

  1. Papers related to the model checking contest
  2. Results of the past years
  3. Some Scientific Papers Mentioning the Model Checking Contest

Papers related to the model checking contest

Results of the past years

Some Scientific Papers Mentioning the Model Checking Contest

  1. Pinpointing Conflicts in Temporal Knowledge Bases via Model Checking (2023)
  2. Efficient Strategies to Compute Invariants, Bounds and Stable Places of Petri nets (2023)
  3. Implementing a CTL Model Checker with μ G, a Language for Programming Graph Neural Networks (2023)
  4. A Truly Symbolic Linear-Time Algorithm for SCC Decomposition (2023)
  5. Anti-Patterns (Smells) in Temporal Specifications (2023)
  6. SMPT: A Testbed for Reachability Methods in Generalized Petri Nets (2023)
  7. Leveraging polyhedral reductions for solving Petri net reachability problems (2023)
  8. Introduction to the special issue for SPIN 2021 (2023)
  9. Leveraging polyhedral reductions for solving Petri net reachability problems (2022)
  10. A Decision Diagram Operation for Reachability (2022)
  11. Model-checking ecological state-transition graphs (2022)
  12. LTL Under Reductions with Weaker Conditions Than Stutter Invariance (2022)
  13. From Spot 2. to pot 2.10 : what's new?' (2022)
  14. Verifiable Biology (2022)
  15. CESRBDDs: binary decision diagrams with complemented edges and edge-specified reductions (2022)
  16. Behavioral Property Analysis and Supervisory Control of Petri Nets Using Semi-Structural Approaches (2022)
  17. Aggregation of clans to speed-up solving linear systems on parallel architectures (2022)
  18. Two Dimensional Bounded Model Checking for Unbounded Client-Server Systems (2022)
  19. Using Approximation for the Verification of Token-Scaling Models (2022)
  20. Analyzing and Predicting Verification of Data-Aware Process Models–A Case Study With Spectrum Auctions (2022)
  21. Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking (2022)
  22. Bounded Model Checking for Unbounded Client-Server Systems (2022)
  23. Methods for Efficient Unfolding of Colored Petri Nets (2022)
  24. Portfolio Management in Explicit Model Checking (2022)
  25. Using Approximation for the Verification of Token-Scaling Models (2022)
  26. Petri-Net-Based Model Checking for Privacy-Critical Multiagent Systems (2022)
  27. Kong: a Tool to Squash Concurrent Places (2022)
  28. starMC: an automata based CTL* model checker (2022)
  29. Property Directed Reachability for Generalized Petri Nets (2022)
  30. Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues (2021)
  31. Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues (2021)
  32. A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking (2021)
  33. Efficient Algorithms for Three Reachability Problems in Safe Petri Nets (2021)
  34. Skeleton Abstraction for Universal Temporal Properties (2021)
  35. Time For Stubborn Game Reductions (2021)
  36. The VLSAT-2 Benchmark Suite (2021)
  37. Extended abstract dependency graphs (2021)
  38. AALTITOAD A Tick Tock Automata Verification Engine (2021)
  39. Solving Finite-Linear-Path CTL-Formulas Using the CEGAR Approach (2021)
  40. The RERS challenge: towards controllable and scalable benchmark synthesis (2021)
  41. Maximal and minimal dynamic Petri net slicing (2021)
  42. A Method for Improving Memory Efficiency of the Reachability Graph Generation Process in General Petri Nets (2021)
  43. ZaligVinder: A generic test framework for string solvers (2021)
  44. Improving Explicit Model Checking for Petri Nets (2021)
  45. Petri Net Based CTL Model Checking: Using a New Method to Construct OBDD Variable Order (2021)
  46. Improvements in Unfolding of Colored Petri Nets (2021)
  47. The Reachability Problem for Acyclic Join-Free Petri nets is NP-complete (2021)
  48. Unfolding of Colored Petri Nets by Color Quotienting and Approximation (2021)
  49. Accelerating the Computation of Dead and Concurrent Places using Reductions (2021)
  50. Firing Partial Orders in a Petri Net (2021)
  51. Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized (2021)
  52. Skeleton Abstraction for Universal Temporal Properties (2021)
  53. Symbolic and Structural Model-Checking (2021)
  54. Efficient Algorithms for Three Reachability Problems in Safe Petri Nets (2021)
  55. A Lazy Query Scheme for Reachability Analysis in Petri Nets (2021)
  56. On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets (2021)
  57. Büchi-Automata guided Partial Order Reduction for LTL (2020)
  58. Unfolding of Coloured Petri Nets — Comparing the Runtime of two Approaches (2020)
  59. Efficient Strategies for CEGAR-Based Model Checking (2020)
  60. Symbolic Model Checking with Sentential Decision Diagrams (2020)
  61. A New Approach for the Symbolic Model Checking of Petri Nets (2020)
  62. Strategies, Model Checking and Branching-Time Properties in Maude (2020)
  63. AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL (2020)
  64. The VLSAT-1 Benchmark Suite (2020)
  65. Proposal for Adding Useful Features to Petri-Net Model Checkers (2020)
  66. Petri Net Based Symbolic Model Checking for Computation Tree Logic of Knowledge (2020)
  67. Verification of Token-Scaling Models using an Under-Approximation (2020)
  68. Portfolio Management in Explicit Model Checking (2020)
  69. Faster Enabledness-Updates for the Reachability Graph Computation (2020)
  70. A CTL* Model Checker for Petri Nets (2020)
  71. Efficient Unfolding of Coloured Petri Nets Using Interval Decision Diagrams (2020)
  72. Modular Model Checking of Reference Nets: MoMoC (2020)
  73. Modeling the Raft Distributed Consensus Protocol in LNT (2020)
  74. MCC: a Tool for Unfolding Colored Petri Nets in PNML Format (2020)
  75. Unfolding of Coloured Petri Nets — Comparing the Runtime of two Approaches (2020)
  76. Formale Methoden für rekonfigurierbare cyber-physische Systeme in der Produktion (2020)
  77. Automatic Decomposition of Petri Nets into Automata Networks - A Synthetic Account (2019)
  78. Efficient Learning and Analysis of System Behavior (2019)
  79. Can machine learning automatically choose your best model checking strategy? (2019)
  80. Variable order metrics for decision diagrams in system verification (2019)
  81. Solving E (φ U ψ) using the CEGAR Approach (2019)
  82. Generating Hard Benchmark Problems for Weak Bisimulation (2019)
  83. Saturation Enhanced with Conditional Locality: Application to Petri Nets (2019)
  84. Great-Nsolve: A Tool Integration for (Markov Regenerative) Stochastic Petri Nets (2019)
  85. RERS 2019: Combining Synthesis with Real-World Models (2019)
  86. Reflections on Bernhard Steffen’s Physics of Software Tools (2019)
  87. Witness generation in existential CTL model checking (2019)
  88. Experience Report on an Inquiry-Based Course on Model Checking (2019)
  89. Evaluation of model checkers by verifying message passing programs (2019)
  90. Software Architecture of Modern Model Checkers (2019)
  91. Taking Some Burden Off an Explicit CTL Model Checker (2019)
  92. Model Checking Data Flows in Concurrent Network Updates (2019)
  93. Can machine learning automatically choose your best model checking strategy? (2019)
  94. Model checking with generalized Rabin and Fin-less automata (2019)
  95. Improving Saturation Efficiency with Implicit Relations (2019)
  96. Saturation Enhanced with Conditional Locality: Application to Petri Nets (2019)
  97. Counting Petri net markings from reduction equations (2019)
  98. Binary Decision Diagrams with Edge-Specified Reductions (2019)
  99. Stubborn versus structural reductions for Petri nets (2019)
  100. Multi-core On-The-Fly Saturation (2019)
  101. Experience Report on An Inquiry-Based Course on Model Checking (2019)
  102. Abstract Dependency Graphs and Their Application to Model Checking (2019)
  103. TOOLympics 2019: An Overview of Competitions in Formal Methods (2019)
  104. The Rewrite Engines Competitions: A RECtrospective (2019)
  105. Nested-unit Petri nets (2019)
  106. RERS 2018: CTL, LTL, and Reachability (2018)
  107. Synthesizing Subtle Bugs with Known Witnesses (2018)
  108. Synthesizing Subtle Bugs with Known Witnesses (2018)
  109. Modeling and Analyzing Cyber Physical Systems Using High Level Petri Nets (2018)
  110. Petri Net Synthesis with Union/Find (2018)
  111. Simplification of CTL Formulae for Efficient Model Checking of Petri Nets (2018)
  112. Petri Net Reductions for Counting Markings (2018)
  113. Assessing SMT and CLP approaches for workflow nets verification (2018)
  114. Generation of Minimum Tree-Like Witnesses for Existential CTL (2018)
  115. Towards Reliable Benchmarks of Timed Automata (2018)
  116. Decision Diagrams for Petri Nets: A Comparison of Variable Ordering Algorithms (2018), (or here
  117. Petri Net Model Checking with LoLA 2 (2018)
  118. Self-adaptive Model Checking, the Next Step (2018)
  119. A Model Checker Collection for the Model Checking Contest Using Docker and Machine Learning (2018)
  120. A Distributed Fixed-Point Algorithm for Extended Dependency Graphs (2018)
  121. Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (2018)
  122. Generation of Minimum Tree-Like Witnesses for Existential CTL (2018)
  123. Gradient-based Variable Ordering of Decision Diagrams for Systems with Structural Units (2017)
  124. Property-Preserving Generation of Tailored Benchmark Petri Nets (2017)
  125. Explicit state model checking with generalized Büchi and Rabin automata (2017)
  126. A Method to Analyze Predicate Transition Nets Using SPIN Model Checker (2017)
  127. Stubborn Versus Structural Reductions for Petri Nets (2017)
  128. Property-Preserving Parallel Decomposition (2017)
  129. Industrial applications of the PetriDotNet modelling and analysis tool (2017)
  130. A hybrid model checking approach to analysing rule conformance applied to HIPAA privacy rules (2017)
  131. Petri Nets Repository: A Tool to Benchmark and Debug Petri Net Tools (2017)
  132. The physics of software tools: SWOT analysis and vision (2017)
  133. Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation (2017)
  134. Reduction of Workflow Nets for Generalised Soundness Verification (2017)
  135. Faster Simulation of (Coloured) Petri Nets Using Parallel Computing (2017)
  136. Decision Diagrams for Petri Nets: which Variable Ordering? (2017)
  137. Layered Data: A Modular Formal Definition without Formalisms (2016)
  138. TAPAAL and Reachability Analysis of P/T Nets (2016)
  139. A toolchain on model checking SPIN via Kalman Decomposition for control system software (2016)
  140. A Term Rewriting Approach to Analyze High Level Petri Nets (2016)
  141. Multi-core SCC-Based LTL Model Checking (2016)
  142. A Symbolic Model Checker for Petri Nets: pnmc (2016)
  143. Running LoLA 2.0 in a Model Checking Competition (2016)
  144. MARCIE's Secrets of Efficient Model Checking (2016)
  145. MCC'2015 - The Fifth Model Checking Contest (2016)
  146. Component-wise Incremental LTL Model Checking (2016)
  147. A Method of Sample Models of Program Construction in Terms of Petri Nets (2015)
  148. Génération de règles de coordination à partir de réseaux de Petri colorés (2015)
  149. Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (2015)
  150. Building a Symbolic Model Checker from Formal Language Description (2015)
  151. Saturation-Based Incremental LTL Model Checking with Inductive Proofs (2015)
  152. New Search Strategies for the Petri Net CEGAR Approach (2015)
  153. Vers l'intégration de paramètres temporels statiques et dynamiques dans les techniques de vérification par ordre partiel (2014)
  154. Bounded Model Checking High Level Petri Nets in PIPE+Verifier (2014)
  155. PeCAn: Compositional Verification of Petri Nets Made Easy (2014)
  156. Formal Modeling and Analysis Techniques for High Level Petri Nets (2014)
  157. Teaching formal methods: Experience at UPMC and UP13 with CosyVerif (2014)
  158. BenchKit, a Tool for Massive Concurrent Benchmarking (2014)
  159. Petri Nets Research at BTU in Cottbus, Germany (2014)
  160. Read, Write and Copy Dependencies for Symbolic Model Checking (2014)
  161. Compilation de réseaux de Petri : modèles haut niveau et symétries de processus (2014)
  162. Formal verification problems in a big data world: towards a mighty synergy (2014)
  163. Advanced Saturation-based Model Checking (2014)
  164. Distributed CTL Model Checking in the Cloud (2013)
  165. Compilation de réseaux de Petri (2013)
  166. Verifiable Design of a Satellite-based Train Control System with Petri Nets (2014)
  167. Unifying the syntax and semantics of modular extensions of Petri nets (2013)
  168. Modeling and Analyzing Wireless Sensor Networks with VeriSensor : An Integrated Workflow (2013)
  169. Building Petri nets tools around Neco compiler (2013)
  170. LTL Model Checking with Neco (2013)
  171. MaRDiGraS : Simplified Building of Reachability Graphs on Large Clusters (2013)
  172. CosyVerif: An Open Source Extensible Verification Environment (2013)
  173. A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems (2013)
  174. Unifying the syntax and semantics of modular extensions of Petri nets (2013)
  175. Half a century after Carl Adam Petri's Ph.D. thesis: A perspective on the field (2013)
  176. Verification based on unfoldings of Petri nets with read arcs (2013)
  177. High-level Petri net model checking : the symbolic way (2012)
  178. Stubborn Sets for Simple Linear Time Properties (2012)
  179. High-Level Petri Net Model Checking with AlPiNA (2011)
  180. Crocodile : A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag (2011)