321 Hits in 2.6 sec

Bounded Model Checking High Level Petri Nets in PIPE+Verifier [chapter]

Su Liu, Reng Zeng, Zhuo Sun, Xudong He
2014 Lecture Notes in Computer Science  
We show our results of applying PIPE+Verifier to several models from the Model Checking Contest @ Petri Nets and a few other sources.  ...  Exhaustive analysis methods such as traditional model checking based on fixed point calculation of state space may not work for HLPNs due to the state explosion problem.  ...  152s 15.26s 6 Related Work 6.1 Petri Nets Tools Table 6 . 6 Analysis Tools for Petri NetsNeco Neco [21] is a Unix toolkit that checks the reachability and other properties of high level Petri  ... 
doi:10.1007/978-3-319-11737-9_23 fatcat:fziejbvvuzdoto62hv52cfgvlu

Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account [chapter]

Pierre Bouvier, Hubert Garavel, Hernán Ponce-de-León
2020 Lecture Notes in Computer Science  
We reformulate this problem as the transformation of an ordinary, one-safe Petri net into a flat, unit-safe NUPN (Nested-Unit Petri Net) and define a quality criterion based on the number of bits required  ...  We propose various transformation methods, all of which we implemented in a tool chain that combines NUPN tools with third-party software, such as SAT solvers, SMT solvers, and tools for graph colouring  ...  The present paper describes a state-of-the-art approach based on (partial) reachability analysis for translating ordinary, safe Petri nets into automata networks.  ... 
doi:10.1007/978-3-030-51831-8_1 fatcat:bvqqmr2dkfhutjjdavq2yluoha

Symbolic and Structural Model-Checking [article]

Yann Thierry-Mieg
2021 arXiv   pre-print
Brute-force model-checking consists in exhaustive exploration of the state-space of a Petri net, and meets the dreaded state-space explosion problem.  ...  This approach was able to win by a clear margin the model-checking contest 2020 for reachability queries as well as deadlock detection, thus demonstrating the practical effectiveness and general applicability  ...  Simplification of CTL Formulae for Efficient Model Checking of Petri Nets. In: Petri Nets, volume 10877 of Lecture Notes in Computer Science.  ... 
arXiv:2005.12911v4 fatcat:j4kuvb5lwvasfokknrxn27665a

On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets [article]

Nicolas Amat
2021 arXiv   pre-print
We define a new method for taking advantage of net reductions in combination with a SMT-based model checker.  ...  Our approach consists in transforming a reachability problem about some Petri net, into the verification of an updated reachability property on a reduced version of this net.  ...  SMT-based Model Checking Using Abstractions We introduce a general method for combining polyhedral abstractions with SMT-based model checking procedures.  ... 
arXiv:2104.09850v2 fatcat:croiujels5e6pb5mhxwce6dnsq

KReach: A Tool for Reachability in Petri Nets [chapter]

Alex Dixon, Ranko Lazić
2020 Lecture Notes in Computer Science  
We present KReach, a tool for deciding reachability in general Petri nets. The tool is a full implementation of Kosaraju's original 1982 decision procedure for reachability in VASS.  ...  Preliminary tests suggest that there are some classes of Petri nets for which we can quickly show unreachability.  ...  Two of the most studied decision problems on Petri nets are those of coverability and reachability. Coverability is the central decision problem for verifying safety properties on Petri nets.  ... 
doi:10.1007/978-3-030-45190-5_22 fatcat:4vbpzzrf3vffdfaage7j5brxgm

Theta: A framework for abstraction refinement-based model checking

Tamas Toth, Akos Hajdu, Andras Vorcos, Zoltan Micskei, Istvan Majzik
2017 2017 Formal Methods in Computer Aided Design (FMCAD)  
The goal of the framework is to support the design, execution and evaluation of abstraction refinement-based reachability analysis algorithms for models of different formalisms.  ...  We demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models.  ...  As an example, suppose that one wants to add support for the reachability checking of Petri nets [12] .  ... 
doi:10.23919/fmcad.2017.8102257 dblp:conf/fmcad/TothHVMM17 fatcat:f5qmm4cxzrgfdntw53jb4746ai

BPPChecker: An SMT-based Model Checker on Basic Parallel Processes(Full Version) [article]

Ying Zhao, Jinhao Tan, Guoqiang Li
2021 arXiv   pre-print
We propose constraint-based algorithms for the problem of model checking on BPPs and handle formulas by SMT solver Z3.  ...  Petri nets and its extensions are used in most works. However, existing verifiers based on Petri nets are difficult to be complete and efficient.  ...  For coverability and boundedness on Petri nets, the complexity is EXPSPACE-complete [11, 28, 1] .  ... 
arXiv:2110.09414v2 fatcat:drvexe3xvvhrritgxffj7gwv5q

Approaching the Coverability Problem Continuously [chapter]

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2016 Lecture Notes in Computer Science  
A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT.  ...  The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs.  ...  We would like to thank Vincent Antaki for an early implementation of Algorithm 2. We would also like to thank Gilles Geeraerts for his support with the MIST file format.  ... 
doi:10.1007/978-3-662-49674-9_28 fatcat:ew3tjdzopzdanphebjghhohtyy

MCC'2017 – The Seventh Model Checking Contest [chapter]

Fabrice Kordon, Hubert Garavel, Lom Messan Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, Francis Hulin-Hubard, Elvio Amparore, Marco Beccuti, Bernard Berthomieu, Hugues Evrard, Peter G. Jensen, Didier Le Botlan (+6 others)
2018 Lecture Notes in Computer Science  
This article presents the principles and results of the 2017 edition of the MCC, which took place along with the Petri Net and ACSD joint conferences in Zaragoza, Spain.  ...  and model checking.  ...  Tina Tina (TIme Petri Net Analyzer) [7] is a toolbox for the editing and analysis of various extensions of Petri nets and Time Petri nets, developed at LAAS-CNRS.  ... 
doi:10.1007/978-3-662-58381-4_9 fatcat:udvhoqbycjdp7gsjkfctic5zbe

Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking

Nao IGAWA, Tomoyuki YOKOGAWA, Sousuke AMASAKI, Masafumi KONDO, Yoichiro SATO, Kazutami ARIMOTO
2020 IEICE transactions on information and systems  
This paper proposed an efficient verification method for TPN introducing bounded model checking based on satisfiability solving.  ...  Safety critical systems are often modeled using Time Petri Nets (TPN) for analyzing their reliability with formal verification methods.  ...  A part of the experiments was conducted with the support of the 2017 research grant of the Okawa Foundation for Information and Telecommunications.  ... 
doi:10.1587/transinf.2019edl8086 fatcat:6frvwb6xwrcpxnkwfjkzq542da

Presentation of the 9th Edition of the Model Checking Contest [chapter]

Elvio Amparore, Bernard Berthomieu, Gianfranco Ciardo, Silvano Dal Zilio, Francesco Gallà, Lom Messan Hillah, Francis Hulin-Hubard, Peter Gjøl Jensen, Loïg Jezequel, Fabrice Kordon, Didier Le Botlan, Torsten Liebke (+7 others)
2019 Msphere  
The Model Checking Contest (MCC) is an annual competition of software tools for model checking.  ...  in the model, evaluation of reachability formulas, evaluation of CTL formulas, and evaluation of LTL formulas.  ...  TINA.tedd TINA (TIme Petri Net Analyzer) [11] is a toolbox for the editing and analysis of various extensions of Petri nets and Time Petri nets developed at LAAS-CNRS.  ... 
doi:10.1007/978-3-030-17502-3_4 fatcat:i63wf7m4fzggxpl54xxwpv3jei

PIPE+Verifier - A Tool for Analyzing High Level Petri Nets

Su Liu, Xudong He
2015 Proceedings of the 27th International Conference on Software Engineering and Knowledge Engineering  
In our prior work, we have developed a method based on BMC and a supporting tool PIPE+Verifier to analyze high level Petri nets using a state of the art satisfiability modulo theories (SMT) solver Z3 as  ...  Bounded model checking (BMC) is a promising analysis method that explores state space within a predefined bound.  ...  Acknowledgments We thank three anonymous reviewers for their helpful comments.  ... 
doi:10.18293/seke2015-60 dblp:conf/seke/LiuH15 fatcat:anpac22fpnbaveixy4ztf46tzm

An SMT-Based Approach to Coverability Analysis [chapter]

Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp Meyer, Filip Niksic
2014 Lecture Notes in Computer Science  
We revisit a constraint approach to coverability based on classical Petri net analysis techniques.  ...  Model checkers based on Petri net coverability have been used successfully in recent years to verify safety properties of concurrent shared-memory or asynchronous message-passing software.  ...  We thank Emanuele D'Osualdo for help with the Soter tool. Ledesma-Garza was supported by the Collaborative Research Center 1480 "Program and Model Analysis" funded by the German Research Council.  ... 
doi:10.1007/978-3-319-08867-9_40 fatcat:hhnui6ec3ja2rghjehfa3u2qtu

The Logical View on Continuous Petri Nets

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2017 ACM Transactions on Computational Logic  
ACKNOWLEDGMENTS We would like to thank Vincent Antaki for an early implementation of the polynomial-time algorithm of Fraca and Haddad [2015] , and also Gilles Geeraerts for his support with the MIST  ...  We are grateful to the anonymous reviewers of TACAS'16 and ACM TOCL for their comments and suggestions.  ...  for discrete Petri nets.  ... 
doi:10.1145/3105908 fatcat:a7crufoegzexzhndl6j2aviknm

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Reiko Heckel, Leen Lambers, Maryam Ghaffari Saadat
2019 Electronic Proceedings in Theoretical Computer Science  
The paper summarises the contributions in a session at GCM 2019 presenting and discussing the use of native and translation-based solutions to common analysis problems for Graph Transformation Systems  ...  In addition to a comparison of native and translation-based techniques in this area, we explore design choices for the latter, s.a. choice of logic and encoding method, which have a considerable impact  ...  The GREZ algorithms that require an SMT solver are: • Petri-net approximation: Over-approximates the transition sequences of a GTS by a Petri-net.  ... 
doi:10.4204/eptcs.309.1 fatcat:2n6leydcevejpdnolo7x4rgqtm
« Previous Showing results 1 — 15 out of 321 results