A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
• We can do LTL model checking on high-level Petri nets with versatile fairness constraints on the transitions
Outline • Outline Why is fairness important? ...
This holds only under a fairness constraint. • Using the powerful type system and algebraic operations of Maria, modelling is straightforward. • Complete model: 12 places and 9 high-level transitions. ...
doi:10.1007/3-540-45740-2_15
fatcat:hfvn554qzvdallxzbmnowwztpu
LTL Model Checking with Neco
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We introduce neco-spot, an LTL model checker for Petri net models. ...
It builds upon Neco, a compiler turning Petri nets into native shared libraries that allows fast on-the-fly exploration of the state-space, and upon Spot, a C++ library of model-checking algorithms. ...
Introduction Neco is a suite of Unix tools to compile high-level Petri net models into shared libraries that can then be used to check reachability properties (building only the set of reachable states ...
doi:10.1007/978-3-319-02444-8_33
fatcat:2mxpzne42fhcfl2yc4dybega5e
Maria: Modular Reachability Analyser for Algebraic System Nets
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Maria performs simulation, exhaustive reachability analysis and on-the-fly LTL model checking of high-level Petri nets with fairness constraints. ...
Models can be exported to low-level Petri nets and labelled transition systems. ...
Acknowledgements The LTL model checker algorithm in Maria was originally implemented by Timo Latvala. ...
doi:10.1007/3-540-48068-4_25
fatcat:rrxv2wnelvgp5go6g574dcrmui
Symbolic Model-Checking Using ITS-Tools
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present verification toolset ITS-tools, featuring a symbolic modelchecking back-end engine based on hierarchical set decision diagrams (SDD) that supports reachability, CTL and LTL model-checking and ...
Using model transformations to a Guarded Action Language (GAL) as intermediate format, ITS-tools can analyze third party (Uppaal, Spin, Divine...) specifications. ...
The ITS-tools is the result of many years of collaborative development with both colleagues and students at LIP6, without whom this tool presentation would not be possible. ...
doi:10.1007/978-3-662-46681-0_20
fatcat:wuraebux5rguvm5k2gxdb2zpg4
Formally analyzing software architectural specifications using SAM
2004
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Petri nets are used to visualize the structure and model the behavior of software architectures while temporal logic is used to specify the required properties of software architectures. ...
Most importantly, SAM supports formal analysis of software architecture properties in a variety of well-established techniques--simulation, reachability analysis, model checking, and interactive proving ...
Acknowledgements We thank two anonymous reviewers for their helpful comments, which help improve the presentation of this paper. ...
doi:10.1016/s0164-1212(02)00087-0
fatcat:6sn7vpfh7bc23nrabgw3wv2krq
Component-wise incremental LTL model checking
2016
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The resulting on-the-fly, incremental LTL model checking algorithm proved to scale well with the size of models, as the evaluation on models of the Model Checking Contest suggests. ...
Model checking LTL properties usually poses two challenges: one must compute the synchronous product of the state space and the automaton model of the desired property, then look for counterexamples that ...
Acknowledgments This work was partially supported by the ARTEMIS JU and the Hungarian National Research, Development and Innovation Fund in the frame of the R5-COP project. ...
doi:10.1007/s00165-015-0347-x
fatcat:atvkwn3rgjb73luyyvxnttn7cq
Model Checking Data Flows in Concurrent Network Updates (Full Version)
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For safe Petri nets with transits, we reduce the verification of temporal flow properties to a circuit model checking problem that can be solved with effective verification techniques like IC3, interpolation ...
the data flow caused by each transition of the Petri net. ...
Petri Net Model Checking with Circuits We translate the model checking of an LTL formula ψ with places and transitions as atomic propositions on a safe P/T Petri net with inhibitor arcs N to a model checking ...
arXiv:1907.11061v2
fatcat:onq5wltecrbcrh6l4tifzx6ehe
Extensions and Generalization of the Saturation Algorithm in Model Checking
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This dissertation presents further results in the fields of efficient analysis of models with prioritized transitions and the model checking of linear temporal logic properties, a class of specification ...
Thesis 1 presents an approach to efficiently analyze Generalized Stochastic Petri Nets, a formalism suitable for the modeling of extra-functional aspects of a system. ...
Given the facts that transitions of Petri nets are inherently conditionally local without repartitioning, and many nets are bounded (often safe), model checking of Petri net models with the GSA can be ...
doi:10.5281/zenodo.3690193
fatcat:2enucnqrmbar7fg4u6yroo2pry
On the Formal Verification of Middleware Behavioral Properties
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Then we present the tools and techniques deployed to actually verify the behavioral properties of our model: Petri nets, temporal logic and advanced algorithms to reduce the size of the state space. ...
So far, typical middleware does not come with a complete analysis of their behavioral properties. ...
We selected Well-formed Petri nets (WN) [5] as an input language for model checking. WN are high-level Petri nets, in which tokens are typed data holders. ...
doi:10.1016/j.entcs.2004.08.062
fatcat:dbuonb77mzek3lijar7oyozzge
High Level Petri Nets Analysis with Helena
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents the high level Petri nets analyzer Helena. ...
Helena can be used for the on-the-fly verification of state properties, i.e., properties that must hold in all the reachable states of the system, and deadlock freeness. ...
Helena is a free software available under the conditions of the GNU General Public License. It can be downloaded at the following URL : http://helena.cnam.fr. ...
doi:10.1007/11494744_26
fatcat:m4ma4hqkezfxtdamgib4spqxja
Verification support for workflow design with UML activity graphs
2002
Proceedings of the 24th international conference on Software engineering - ICSE '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Only model checkers that use a special model checking algorithm for strong fairness are suitable for verifying workflow models. We analyse the structure of the state space. ...
With the model checker arbitrary propositional requirements can be checked against the input model. If a requirement fails to hold an error trace is returned by the model checker. ...
Formalisations of Petri nets have problems with modelling these aspects of a workflow [12] . ...
doi:10.1145/581360.581362
fatcat:2dfbiai3ofep3d7x5fxsjt4bi4
Verification support for workflow design with UML activity graphs
2002
Proceedings of the 24th international conference on Software engineering - ICSE '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Only model checkers that use a special model checking algorithm for strong fairness are suitable for verifying workflow models. We analyse the structure of the state space. ...
With the model checker arbitrary propositional requirements can be checked against the input model. If a requirement fails to hold an error trace is returned by the model checker. ...
Formalisations of Petri nets have problems with modelling these aspects of a workflow [12] . ...
doi:10.1145/581339.581362
dblp:conf/icse/EshuisW02
fatcat:hhnscwe4tzcpterbk24qfh45r4
A Method to Analyze High Level Petri Nets using SPIN Model Checker
2017
Proceedings of the 29th International Conference on Software Engineering and Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We discuss several properties and show the detailed model checking results of two properties in one system. ...
High level Petri nets (HLPNs) are a formal method for studying concurrent and distributed systems and have been widely used in many application domains. ...
These are the only high level Petri net models available in the contest, which were defined using colored Petri nets (a type of high level Petri nets). ...
doi:10.18293/seke2017-162
dblp:conf/seke/AlamH17
fatcat:wv65eryzsfe7ln5jjevs3gfgby
Industrial applications of the PetriDotNet modelling and analysis tool
2018
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems. ...
Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems ...
New National Excellence Program of the Ministry of Human Capacities. ...
doi:10.1016/j.scico.2017.09.003
fatcat:3ceytamrxjatbdkdqv4ea5niea
Diagnosability under Weak Fairness
2015
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Diagnosability is an associated property of the Petri net, stating that in any possible execution an occurrence of a fault can eventually be diagnosed. ...
Moreover, we present an efficient method for verifying WF-diagnosability based on a reduction to LTL-X model checking. ...
to model checking of a fixed LTL-X [4, 7] property of the verifier [5] . ...
doi:10.1145/2832910
fatcat:26kfrmbj2bcxhjz67jphfy2ola
« Previous
Showing results 1 — 15 out of 287 results