537 Hits in 1.6 sec

LTL Model Checking for Modular Petri Nets [chapter]

Timo Latvala, Marko Mäkelä
2004 Lecture Notes in Computer Science  
For x ∈ N ·x = {y |yFx} is called the preset of x x· = {y |xFy } is called the postset of x T. Latvala and M.  ...  A triple N = (P, T ; F ) is called a net iff P and T are disjoint sets is a binary relation (the flow relation of N). Definition (Pre-and Post-sets) Let N be a net.  ...  MäkeläPresented by Deian Tabakov Modular Petri Nets... Figure : Figure : :: The Bakery Model T. Latvala and M. MäkeläPresented by Deian Tabakov Modular Petri Nets...  ... 
doi:10.1007/978-3-540-27793-4_17 fatcat:nxopqdx7nbcgpjbqpmpo6b7zwu

PeCAn: Compositional Verification of Petri Nets Made Easy [chapter]

Dinh-Thuan Le, Huu-Vu Nguyen, Van-Tinh Nguyen, Phuong-Nam Mai, Bao-Trung Pham-Duy, Thanh-Tho Quan, Étienne André, Laure Petrucci, Yang Liu
2014 Lecture Notes in Computer Science  
We experimented PeCAn with benchmark datasets from the Petri Nets' model checking contests, showing promising results.  ...  abstractions of multiple Petri nets for more efficient verification.  ...  All our thanks to the PAT team [SLDP09] for their help in interfacing our tool with the PAT library.  ... 
doi:10.1007/978-3-319-11936-6_18 fatcat:pv2uvargbrbfrapyqtk76ol52a

An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets [chapter]

Kais Klai, Laure Petrucci, Michel Reniers
2007 Lecture Notes in Computer Science  
In this paper, we address these problems in the framework of model-checking LTL\X action-based properties on Petri nets.  ...  Model-checking is a powerful and widespread technique for the verification of finite state concurrent systems.  ...  To establish N (1,j) |= ϕ, one can use any standard model checker for LTL\X formulas on Petri nets.  ... 
doi:10.1007/978-3-540-73196-2_18 fatcat:ooehsbz6fjdf3geveo4rng36oq

Formal verification of UML state diagrams

Christine Choppy, Kais Klai, Hacene Zidani
2011 Software engineering notes  
, hierarchical coloured Petri nets  Properties expressed in temporal logic (LTL, CTL), model checking 5 Example Gas station (Customer state diagram) Gas station (Customer state diagram) 6  ...  rules A E F C D B Verification using model- checking Properties (LTL, CTL) satisfied ?  ... 
doi:10.1145/1921532.1921561 fatcat:y6mwmnmn3fcc3dkoo66cf2wimu

Modular and Distributed Verification of SysML Activity Diagrams

Messaoud Rahim, Ahmed Hammad, Malika Ioualalen
2013 Proceedings of the 1st International Conference on Model-Driven Engineering and Software Development  
In this paper, we propose new approach to allow a modular and distributed verification of SysML Activity Diagram basing on the derived Petri net.  ...  Translating SysML-based specification into Petri nets allows to enable rigorous system analysis. However, for complex systems, we have to deal with the state space explosion problem.  ...  ; Abid and Zouari, 2007) for verifying the derived modular Petri net.  ... 
doi:10.5220/0004320602020205 dblp:conf/modelsward/RahimAM13 fatcat:h67lo67lpfagldh3lu3z7lkc6a

Roles at the Basis of UML Validation

Thouraya Bouabana-Tebibel
2007 Journal of Computing and Information Technology  
This approach allows validation of the temporal logic properties translated from the OCL invariants, on the Petri nets derived from the UML models.  ...  To remedy that, we first present a technique for transforming UML statecharts into Petri nets. We develop afterwards, an approach based on the movement of the objects throughout the roles they play.  ...  Petri Nets Petri nets have been presented in several works [2] , [5] as a suitable formalism for translating the UML dynamic models.  ... 
doi:10.2498/cit.1000882 fatcat:agcfm5d3z5eq3olbvq7mbgiqyq

The Model-Checking Kit [chapter]

Claus Schröter, Stefan Schwoon, Javier Esparza
2003 Lecture Notes in Computer Science  
, reachability-checkers, and model-checkers for the temporal logics CTL and LTL [7] .  ...  The Model-Checking Kit [8] is a collection of programs which allow to model finite state systems using a variety of modelling languages, and verify them using a variety of checkers, including deadlock-checkers  ...  originally introduced for Petri nets).  ... 
doi:10.1007/3-540-44919-1_29 fatcat:tq5v4ehsfbbynbsm2a7zfex26e

Verifying linear time temporal logic properties of concurrent Ada programs with quasar

S. Evangelista, C. Kaiser, J. F. Pradat-Peyre, P. Rousseau
2004 ACM SIGAda Ada Letters  
Quasar is based on ASIS and uses formal methods (model checking).  ...  In this paper we present an original and useful way for specifying and verifying temporal properties of concurrent programs with our tool named Quasar.  ...  By this way, we obtain a standard colored Petri net that can be directly analyzed with usual structural and model checking techniques. This modular approach has numerous advantages.  ... 
doi:10.1145/992211.958424 fatcat:a4s7fgr3fza43fdaydm7wlcuhm

Object Dynamics Formalization Using Object Flows within UML State Machines

Thouraya Boubana-Tebibel
2015 Enterprise Modelling and Information Systems Architectures - An International Journal  
To validate formally these properties, we first present a technique for transforming a UML object life cycle model into Object Petri nets.  ...  Thirdly, validation of OCL invariants which are translated into temporal logic properties to be checked on the Petri nets derived from the UML models, requires integration of object flows within the state  ...  Petri nets offer an appropriate formalism for dynamics and concurrency; however, ordinary Petri nets lack thorough modularization techniques.  ... 
doi:10.18417/emisa.2.1.3 dblp:journals/emisaij/Bouabana-Tebibel07 fatcat:o5galyz5q5eatiq222kmyry6ne

Modular Verification of Petri Nets Properties: A Structure-Based Approach [chapter]

Kais Klai, Serge Haddad, Jean-Michel Ilié
2005 Lecture Notes in Computer Science  
In this paper, we address the modular verication problem for a Petri net obtained by composition of two subnets.  ...  Finally, we give a sucient condition for this relation which can be detected modularly using an ecient algorithm.  ...  Proposition 6 leads to a modular model checking approach dealing with innite observed sequences.  ... 
doi:10.1007/11562436_15 fatcat:fiskqvq34vgadfhq6j3ljz452m

PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research [chapter]

András Vörös, Dániel Darvas, Vince Molnár, Attila Klenik, Ákos Hajdu, Attila Jámbor, Tamás Bartha, István Majzik
2016 Lecture Notes in Computer Science  
PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods.  ...  checking algorithms and stochastic analysis algorithms.  ...  Special thanks to Bertalan Szilvási for developing Petri.NET, the initial version of the presented tool.  ... 
doi:10.1007/978-3-319-39086-4_9 fatcat:mzi43mardvco5ncticudso2x6i

A Property-Driven Approach to Formal Verification of Process Models [chapter]

Benoît Combemale, Xavier Crégut, Pierre-Loïc Garoche, Xavier Thirioux, Francois Vernadat
2008 Lecture Notes in Business Information Processing  
We specify a models transformation to Petri Nets and LTL formulae for both the process model and its associated temporal properties.  ...  There are although some attempts on behavioural properties for DSL. This paper addresses a method to specify and then check temporal properties over models.  ...  Denotational Semantics to Petri Net and LTL In this study, we choose to use the technical space of Petri nets as the target representation for formally expressing our process models.  ... 
doi:10.1007/978-3-540-88710-2_23 fatcat:vv7ru5jfcjbxjeqo2wmy2xnpie

Games, Automata, Logics and Formal Verification (GandALF 2014) – Preface

Adriano Peron, Carla Piazza
2017 Information and Computation  
The players are tokens on a Petri net.  ...  The paper Petri Games: Synthesis of Distributed Systems with Causal Memory, coauthored by Bernd Finkbeiner, Ernst-Rüdiger Olderogb, presents a new multiplayer game model for the interaction and the flow  ...  This yields polynomial space algorithms for model checking and assume-guarantee model checking and a realizability algorithm with doubly-exponential running time.  ... 
doi:10.1016/j.ic.2016.07.005 fatcat:4oiouzxwcfh2vfuktawrvodnmu

From UML to Petri Nets for non functional Property Verification

F. Mallet, M-A. Peraldi-Frati, C. Andre
2006 2006 International Symposium on Industrial Embedded Systems  
and Hierarchical Time Petri Nets, 3) the transformation from the specification model to the analysis model.  ...  This paper focuses on 1) the specification of expected behavior by UML activities, specialized to support the synchronous paradigm, 2) the definition of an analysis model for temporal properties: the Modular  ...  Figure 5 : 5 Modular Time Petri Net Model. Figure 6 : 6 Time Petri Net Core Model.  ... 
doi:10.1109/ies.2006.357475 dblp:conf/sies/MalletPA06 fatcat:xiysflhdsrbbhm3mlbknvl5aam

Industrial applications of the PetriDotNet modelling and analysis tool

András Vörös, Dániel Darvas, Ákos Hajdu, Attila Klenik, Kristóf Marussy, Vince Molnár, Tamás Bartha, István Majzik
2018 Science of Computer Programming  
Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems.  ...  This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet.  ...  We are especially grateful for the work of B. Szilvási, A. Jámbor, Z. Mártonka, D. Segesdi, and T. Szabó. We thank M. Telek for the assistance in the design of stochastic analysis algorithms.  ... 
doi:10.1016/j.scico.2017.09.003 fatcat:3ceytamrxjatbdkdqv4ea5niea
« Previous Showing results 1 — 15 out of 537 results