Sciweavers

941 search results - page 44 / 189
» Self-Evolving Petri Nets
Sort
View
AC
2003
Springer
14 years 2 months ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau
APN
2006
Springer
14 years 25 days ago
Nested Nets for Adaptive Systems
We consider nested nets, i.e. Petri nets in which tokens can be Petri nets themselves. We study value semantics of nested nets rather than reference semantics, and apply nested ne...
Kees M. van Hee, Irina A. Lomazova, Olivia Oanea, ...
QEST
2009
IEEE
14 years 3 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 1 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ä
CONCUR
1992
Springer
14 years 1 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...