Results 1 
4 of
4
Quickly prototyping Petri nets tools with SNAKES
, 2008
"... This paper presents the toolkit snakes that is aimed at providing a flexible solution to the problem of quickly prototyping Petri nets tools. In particular, snakes is expected to have as few builtin limitations as possible with respect to the particular variant of Petri net to be used. The goal is ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
This paper presents the toolkit snakes that is aimed at providing a flexible solution to the problem of quickly prototyping Petri nets tools. In particular, snakes is expected to have as few builtin limitations as possible with respect to the particular variant of Petri net to be used. The goal is to make snakes suitable for any kind of Petri net model, including new ones for which there exists no available tool. For this purpose, snakes is designed as a very general Petri net core library enriched with a set of extension modules to provide specialised features. On the one hand, the core library is versatile in that it defines a general Petri net structure where all the computational aspects are delegated to an interpreted programming language. On the other hand, the extension modules provide with enough flexibility to allow to redefine easily any part of the base Petri net model. snakes is released under the gnu lgpl, it can be downloaded at
Versatile boxes: a multipurpose algebra of highlevel Petri nets
 DADS/SCSC’07, SCS/ACM
, 2007
"... This paper introduces a model of composable Petri nets, called Versatile Boxes, that has all the highlevel features already introduced in the family of the Petri Box Calculus (mainly: data and time representation) as well as a new interruption capability. This allows for defining processes that are ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
This paper introduces a model of composable Petri nets, called Versatile Boxes, that has all the highlevel features already introduced in the family of the Petri Box Calculus (mainly: data and time representation) as well as a new interruption capability. This allows for defining processes that are able to interrupt their execution at any point, just as a program can raise an exception. By choosing a carefully tuned level of generality, we are able to obtain a model that is much simpler than previous approaches, while still allowing to give the semantics of the usual programming language constructs. We believe that our model has the required characteristics for a very general use, hence its name. On the other hand, its is not very complex and so it should be easy to understand or implement and efficient for verification or simulation purpose. 1.
Conflict Points for Better Prefixes
"... Abstract Concurrent systems are usually studied using interleaving semantic models, which consider the events of a system to be totally ordered. An alternative to these models is to use noninterleaving (true concurrency) models, which consider events to be just partially ordered. An important expon ..."
Abstract
 Add to MetaCart
Abstract Concurrent systems are usually studied using interleaving semantic models, which consider the events of a system to be totally ordered. An alternative to these models is to use noninterleaving (true concurrency) models, which consider events to be just partially ordered. An important exponent of the latter approach was introduced by McMillan and later refined by several others. It embodies the construction of the complete finite prefix of the (usually) infinite unfolding of a concurrent system. The algorithm to construct such a complete finite prefix is parameterized by a special kind of partial order on the configurations of the system. Historically, these orders have been defined on the basis of the syntactical structure of the system description. This means that it is impossible to have control on the structure of a prefix. For efficiently using a prefix in reachability analysis and model checking, it is very important to be able to generate prefixes with a “nice ” structure. Therefore, in this paper, we present the family of such orders generated by a special enumeration of the nodes of an unfolding. The concept of conflict point is introduced and aids the definition of this family. Conflict points mark the actual diversions between configurations. This has the advantage that the adequate order does no need to be specified a priori, but instead can be constructed “on the fly”. Experimental evidence is provided. 1
Replace
"... this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. Efficient reachability graph representation of Petri nets with unbounded counters ..."
Abstract
 Add to MetaCart
(Show Context)
this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. Efficient reachability graph representation of Petri nets with unbounded counters