• Aucun résultat trouvé

HIGH LEVEL PETRI NETS WITH DATA STRUCTURE

N/A
N/A
Protected

Academic year: 2021

Partager "HIGH LEVEL PETRI NETS WITH DATA STRUCTURE"

Copied!
31
0
0

Texte intégral

(1)

HAL Id: hal-00968326

https://hal.inria.fr/hal-00968326

Submitted on 17 Apr 2014

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

HIGH LEVEL PETRI NETS WITH DATA

STRUCTURE

Christophe Sibertin-Blanc

To cite this version:

Christophe Sibertin-Blanc. HIGH LEVEL PETRI NETS WITH DATA STRUCTURE. 6th European Workshop on Application and Theory of Petri Nets, Jul 1985, Espoo, Finland. pp.141-168. �hal-00968326�

(2)

HIGH LEVEL PETRI NETS WITH DATA STRUCTURE

C. Sibertin-Blanc

Université Toulouse 1 – Capitole F-31042 Toulouse Cedex, France

[email protected]

Abstract. For the lack of a data structure, Petri nets are not

suitable for modeling systems such as Information Systems, where data have an effect on the system’s behavior. In the High Level Petri Nets we set out here, tokens are replaced by entities which are described by means of a model closely related to those of the Database Theory. In order to take into account the values of entities, a precondition and an action may be associated to each transition. This data structure allows to define new nets’ properties, which are analyzed by Program Theory techniques, whereas a lot of results provided by linear algebra remain valid. In addition, computation of invariants may be done.

The matter of this paper comes from the doctoral dissertation of the author.

6th European Workshop on Application and Theory of Petri Nets, K. Jensen Ed, Espoo, June 1985.

(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)
(27)
(28)
(29)
(30)
(31)

Références

Documents relatifs

The entry, exit and internal places are used to model the control flow of a Petri net and are so called control flow places.. The others are called data places as they store all

Besides this biological case study, the contribution of the paper is also on a more abstract level. Indeed, our approach overpasses the pure application con- text and allows a

Neco compiler is entirely implemented in Python using snakes to handle the Petri nets and abcd as an input lan- guage [14].. Apart from abcd , the Petri net semantics of various

Termination, soundness, and coverability for symbolic set of initial cases defined by a monotonous pattern are decidable properties on the class of backward-effective wqo-StDN

As the proposed semantics use tuples to describe a marking, there is a clear dif- ference between a place and its tokens. Therefore, a marking will be very clear and the number

We define a class of Petri nets suitable for a parallel execution machine which preserves the step sequence semantics of the nets and ensures time consistent executions while

We define a class of Petri nets suitable for a parallel execution machine which preserves the step sequence semantics of the nets and ensures time consistent executions while

We therefore wish to merge algorithm 1 (augmented to handle priority as described earlier) and 3 into a single algorithm sharing Unknown, Disabled, and MaybeReady in a way that makes