Show simple item record

dc.contributor.authorHaddad, Serge
dc.contributor.authorPoitrenaud, Denis
dc.date.accessioned2014-05-20T14:37:57Z
dc.date.available2014-05-20T14:37:57Z
dc.date.issued2007
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/13341
dc.language.isoenen
dc.subjectBisimulationen
dc.subjectReachability problemen
dc.subjectExpressivityen
dc.subjectFlows computationen
dc.subjectPetri netsen
dc.subject.ddc003en
dc.titleRecursive Petri netsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn 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.en
dc.relation.isversionofjnlnameActa Informatica
dc.relation.isversionofjnlvol44en
dc.relation.isversionofjnlissue7-8en
dc.relation.isversionofjnldate2007
dc.relation.isversionofjnlpages463-508en
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s00236-007-0055-yen
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record