• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Recursive Petri nets

Thumbnail
View/Open
acta07.pdf (483.7Kb)
Date
2007
Dewey
Recherche opérationnelle
Sujet
Bisimulation; Reachability problem; Expressivity; Flows computation; Petri nets
Journal issue
Acta Informatica
Volume
44
Number
7-8
Publication date
2007
Article pages
463-508
Publisher
Springer
DOI
http://dx.doi.org/10.1007/s00236-007-0055-y
URI
https://basepub.dauphine.fr/handle/123456789/13341
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Haddad, Serge
Poitrenaud, Denis
Type
Article accepté pour publication ou publié
Abstract (EN)
In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.