Sciweavers

969 search results - page 41 / 194
» Recursive Petri nets
Sort
View
QEST
2009
IEEE
14 years 4 months ago
Integrating TPNs and Performance Bound Techniques in ITPN-PerfBound: A New Import Functionality
Abstract—ITPN-PerfBound is a graphical tool for the modeling and performance bound analysis of Interval Time Petri Nets (ITPN), that has been developed within the DrawNET modelin...
Elina Pacini Naumovich, Simona Bernardi
LPNMR
2001
Springer
14 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
ISSE
2010
13 years 4 months ago
Coloured Petri net refinement specification and correctness proof with Coq
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...
Christine Choppy, Micaela Mayero, Laure Petrucci
CONCUR
1992
Springer
14 years 2 months ago
On the Semantics of Petri Nets
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
José Meseguer, Ugo Montanari, Vladimiro Sas...
ECEASST
2008
73views more  ECEASST 2008»
13 years 10 months ago
Negative Application Conditions for Reconfigurable Place/Transition Systems
: This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and ...
Alexander Rein, Ulrike Prange, Leen Lambers, Kathr...