Results 151 to 160 of about 315,703 (191)

On the abstraction of coloured Petri Nets

1997
This paper considers the appropriate properties for abstract net components in the Coloured Petri Net formalism. In doing so, it attempts to maintain the duality between places and transitions which is so foundational to Petri Net theory. It also defines what it means to execute the net at an abstract level.
openaire   +2 more sources

Property specification for coloured petri nets

2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2005
The coloured Petri nets is a powerful modelling framework, which allows designers to attach values of complex types (colors) to moving objects (tokens). Using analysis techniques of the classical Petri nets for the coloured Petri nets demands abstracting from colors that can be a source of errors.
openaire   +1 more source

Coloured Petri Nets for Chronicle Recognition

2009
An activity is described by a chronicle that expresses relationships between events in a sequence ordered in time. A chronicle language provides a syntax for the different chronicle operators considered. The recognition of chronicles is used in the processing of complex system simulations so as to detect activities or analyse behaviours.
Christine Choppy, Olivier Bertrand, Patrice Carle   +2 more
openaire   +2 more sources

Orthogonal transformations for coloured Petri nets

1997
In this paper we describe a multirelational approach for performing linear algebraic manipulations of (coloured) Petri nets. In particular, we show how orthogonal transformations can be used in order to describe the net folding and unfolding operations.
Eike Best, Thomas Thielke
openaire   +2 more sources

Analysing a missile simulator with coloured Petri nets

International Journal on Software Tools for Technology Transfer (STTT), 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven Gordon, Jonathan Billington
openaire   +3 more sources

Unfoldings of Coloured Petri Nets

2001
In this paper the unfolding technique is applied to coloured Petri nets (CPN) [6,7]. The technique is formally described, the definition of a branching process of CPN is given. The existence of the maximal branching process and the important properties of CPN's unfoldings are proven.
openaire   +2 more sources

Haskell-Coloured Petri Nets

2000
Colored Petri Nets (CPNs) are a high-level form of Petri Nets, in which transition inscriptions in some programming language operate on individual tokens, i.e., tokens attributed with values of the inscription language. Petri Nets have been known to combine well with functional inscription languages, but complex or even proprietary implementations have
openaire   +1 more source

A Modelling Approach with Coloured Petri Nets

2008
When designing a complex system with critical requirements (e.g. for safety issues), formal models are often used for analysis prior to costly hardware/software implementation. However, writing the formal specification starting from the textual description is not easy.
CHOPPY C, PETRUCCI L, REGGIO, GIANNA
openaire   +2 more sources

Analysing a mechatronic system with coloured Petri nets

International Journal on Software Tools for Technology Transfer (STTT), 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilles Moncelet, Søren Christensen, Hamid Demmou, Mario Paludetto, José Porras   +4 more
openaire   +1 more source

From DB-nets to Coloured Petri Nets with Priorities

2019
The recently introduced formalism of DB-nets has brought in a new conceptual way of modelling complex dynamic systems that equally account for the process and data dimensions, considering local data as well as persistent, transactional data. DB-nets combine a coloured variant of Petri nets with name creation and management (which we call \(\nu \)-CPN),
Marco Montali, Andrey Rivkin
openaire   +2 more sources