Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms

Bernardinello, Luca; Mangioni, Elisabetta; Pomello, Lucia

doi:10.1007/978-3-642-40465-8_3

Cited by 9 publications

(34 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we present the formal definition of α-morphisms [3,2] for State Machine Decomposable Elementary Net Systems (SMD-EN Systems) and the structural and behavioural properties α-morphisms preserve and reflect.…”

Section: α-Morphismsmentioning

confidence: 99%

“…In [8] and [3] structural and behavioral properties preserved or reflected by α-morphisms has been studied. In particular, sequential components are reflected in the sense that the inverse image of a sequential component is covered by sequential components and α-morphisms preserve reachable markings.…”

Section: α-Morphismsmentioning

confidence: 99%

“…In this section, we recall the composition of SMD-EN Systems based on α-morphisms as defined in [1], on the basis of an uninterpreted example given in Fig. 1.…”

Section: Composition Based On α-Morphismsmentioning

confidence: 99%

“…In [1] we proposed a way to compose Elementary Net Systems (ENS) by identifying conditions, places, and events. The identification is ruled by a pair of morphisms from the two components to an interface.…”

Section: Introductionmentioning

confidence: 99%

“…Later, the same operation was defined over a new class of morphisms, called α-morphisms (see [3] and [1]). …”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Modeling Distributed Private Key Generation by Composing Petri Nets

Bernardinello

Kılınç

Mangioni

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We present a Petri net model of a protocol for the distributed generation of id-based private keys. Those keys can then be used for secure communications. The components of the system are built as refinements of a common interface, by applying a formal operation based on a class of morphisms between Elementary Net Systems. It is then shown that we can derive behavioural properties of the composed system without building it explicitly, by exploiting properties of the given morphisms.

show abstract

Section: α-Morphismsmentioning

confidence: 99%

Section: α-Morphismsmentioning

confidence: 99%

“…In this section, we recall the composition of SMD-EN Systems based on α-morphisms as defined in [1], on the basis of an uninterpreted example given in Fig. 1.…”

Section: Composition Based On α-Morphismsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Later, the same operation was defined over a new class of morphisms, called α-morphisms (see [3] and [1]). …”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Modeling Distributed Private Key Generation by Composing Petri Nets

Bernardinello

Kılınç

Mangioni

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Compositional Process Model Synthesis Based on Interface Patterns

Nesterov

Lomazova

2017

Communications in Computer and Information Science

View full text Add to dashboard Cite

Coordination of several distributed system components is an error-prone task, since interaction of several simple components can generate rather sophisticated behavior. Verification of such systems is very difficult or even impossible because of the so-called state space explosion problem, when the size of the system reachability set grows exponentially on the number of interacting agents. To overcome this problem several approaches to construct correct models of interacting agents in a compositional way were proposed in the literature. They define different properties and conditions to ensure correct behavior of interacting agents. Checking these conditions may be in its turn quite a problem.In this paper we propose patterns for correct composition of component models. For justifying these patterns we use special net morphisms. However, to apply patterns the user does not need to be familiar with the underlying theory.

show abstract

Property-Preserving Transformations of Elementary Net Systems Based on Morphisms

Bernardinello

Lomazova

Nesterov

et al. 2022

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Structural transformations that preserve properties of formal models of concurrent systems make their verification easier. We define structural transformations that allow to abstract and refine elementary net systems. Relations between abstract models and their refinements are formalized using morphisms. Transformations proposed in this paper induce morphisms between elementary net systems as well as preserve their behavioral properties. We also show application of the proposed transformations to the construction of a correct composition of interacting workflow net components.

show abstract

Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms

Cited by 9 publications

References 14 publications

Modeling Distributed Private Key Generation by Composing Petri Nets

Modeling Distributed Private Key Generation by Composing Petri Nets

Compositional Process Model Synthesis Based on Interface Patterns

Property-Preserving Transformations of Elementary Net Systems Based on Morphisms

Contact Info

Product

Resources

About