Skip to Main content Skip to Navigation
New interface
Conference papers

Process Refinement and Asynchronous Composition with Modalities

Dorsaf El~hog-Benzina 1 Serge Haddad 1 Rolf Hennicker 2 
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Stefan Haar Connect in order to contact the contributor
Submitted on : Tuesday, January 22, 2013 - 4:49:46 PM
Last modification on : Wednesday, February 2, 2022 - 3:57:31 PM


  • 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⟩



Record views