Results 1 
3 of
3
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.
S.: Behaviour protocols for interacting stateful components
 Electr. Notes Th. Comp. Sci
, 2010
"... We propose a formal foundation for behaviour protocols of interacting components with (encapsulated) data states. Formally, behaviour protocols are given by labelled transition systems which specify the order of operation invocations as well as the allowed changes of data states of components in ter ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We propose a formal foundation for behaviour protocols of interacting components with (encapsulated) data states. Formally, behaviour protocols are given by labelled transition systems which specify the order of operation invocations as well as the allowed changes of data states of components in terms of pre and postconditions. We study the compatibility of protocols and we consider their composition which yields a behaviour protocol for a component assembly. Behaviour protocols are equipped with a modeltheoretic semantics which describes the class of all correct component or assembly implementations. Implementation models are again formalised in terms of labelled transition systems and the correctness notion is based on an alternating simulation relation between protocol and implementation which takes into account both, control and data states. As a major result we show that our approach is compositional, i.e. that correct implementation models of compatible protocols compose to a correct implementation of the resulting assembly protocol.