Process Refinement and Asynchronous Composition with Modalities - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Process Refinement and Asynchronous Composition with Modalities


We propose a framework for the specification of infinite state systems based on Petri nets with distinguished may- and must-transitions (called modalities) which specify the allowed and the required behavior of refinements and hence of implementations. Formally, refinements are defined by relating the modal language specifications generated by two modal Petri nets according to the refinement relation for modal language specifications. We show that this refinement relation is decidable if the underlying modal Petri nets are weakly deterministic. We also show that the membership problem for the class of weakly deterministic modal Petri nets is decidable. As an important application of our approach we consider I/O-Petri nets which are obtained by asynchronous composition and thus exhibit inherently an infinite behavior.


Other [cs.OH]
No file

Dates and versions

hal-00779893 , version 1 (22-01-2013)


  • HAL Id : hal-00779893 , version 1


Dorsaf El~hog-Benzina, Serge Haddad, Rolf Hennicker. Process Refinement and Asynchronous Composition with Modalities. Proceedings of the 2nd International Workshop on Abstractions for Petri Nets and Other Models of Concurrency (APNOC'10), 2010, Braga, Portugal. ⟨hal-00779893⟩
102 View
0 Download


Gmail Facebook X LinkedIn More