Results 1 
4 of
4
Process refinement and asynchronous composition with modalities
 In ACSD/Petri Nets Workshops
, 2010
"... Abstract. We propose a framework for the specification of infinite state systems based on Petri nets with distinguished may and musttransitions (called modalities) which specify the allowed and the required behavior of refinements and hence of implementations. Formally, refinements are defined by ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a framework for the specification of infinite state systems based on Petri nets with distinguished may and musttransitions (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/OPetri nets which are obtained by asynchronous composition and thus exhibit inherently an infinite behavior. Key words: Modal language specification and refinement, modal Petri net, weak determinacy, asynchronous composition, infinite state system.
Refinement and Asynchronous Composition of Modal Petri Nets
"... Abstract. We propose a framework for the specification of infinite state systems based on Petri nets with distinguished mayandmusttransitions (called modalities) which specify the allowed and the required behavior of refinements and hence of implementations. For any modal Petri net, we define its ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a framework for the specification of infinite state systems based on Petri nets with distinguished mayandmusttransitions (called modalities) which specify the allowed and the required behavior of refinements and hence of implementations. For any modal Petri net, we define its generated modal language specification which abstracts away silent transitions. On this basis we consider refinements of modal Petri nets by relating their generated 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 scenario of our approach we consider I/OPetri nets and their asynchronous composition which typically leads to an infinite state system.
Improved Parallel Composition of Labelled Petri Nets
"... Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a ‘messy’ Petri net, with many implicit pla ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a ‘messy’ Petri net, with many implicit places, causing performance deterioration in tools that are based on structural methods. In this paper we propose an optimised algorithm for computing the parallel composition. It often produces nets with fewer implicit places, which are thus better suited for subsequent application of structural methods. Keywords: parallel composition, resynthesis, STG, asynchronous circuits.
Factored Planning: From Automata to Petri Nets
"... Abstract—Factored planning mitigates the state space explosion problem by avoiding the construction of the state space of the whole system and instead working with the system’s components. Traditionally, finite automata have been used to represent the components, with the overall system being repre ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Factored planning mitigates the state space explosion problem by avoiding the construction of the state space of the whole system and instead working with the system’s components. Traditionally, finite automata have been used to represent the components, with the overall system being represented as their product. In this paper we change the representation of components to safe Petri nets. This allows one to use cheap structural operations like transition contractions to reduce the size of the Petri net, before its state space is generated, which often leads to substantial savings compared with automata. The proposed approach has been implemented and proven efficient on several factored planning benchmarks. I.