A class of composable high level Petri nets

Best, Eike; Fleischhack, Hans; Fraczak, Wojciech; Hopkins, Richard P.; Klaudel, Hanna; Pelz, Elisabeth

doi:10.1007/3-540-60029-9_36

Cited by 35 publications

(13 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It was introduced in [6] as an abstract and flexible meta-language for the definition of the semantics of concurrent programming languages. The most distinguishing feature of the M-nets is given by the rich set of composition operators they provide.…”

Section: M-netsmentioning

confidence: 99%

“…So far, the PEP* tool (Programming Environment based on Petri Nets [7,18]) supports a variety of (high-level) modelling techniques: -B(PN) 2 (Basic Petri Net Programming Notation) a parallel programming language [8,5,13], -M-nets (Modular multilabelled nets) an algebra of high-level Petri nets [6], -PFA (Parallel Finite Automata) [16] a collection of FA (Finite Automata).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Combining finite automata, parallel programs and SDL using Petri nets

Grahlmann

1998

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract.This paper introduces a method to combine finite automata, parallel programs and SDL (Specification and Description Language) specifications. We base our approach on M-nets exploiting the rich set of composition operators available in this algebra of high-level Petri nets. In order to be able to combine different modelling techniques, we rely on compatible interfaces. Therefore, -we extend an existing semantics, namely the M-net semantics for the parallel programming language B(PN)2; and -we present an M-net semantics for finite automata. Considering the hybrid modelling of an ARQ (Automatic Repeat reQuest) protocol, we show how the different formalisms fit together as well as the resulting verification possibilities. As a side-effect we describe on-going development of the PEP tool (Programming Environment based on Petri Nets). As a consequence of our approach we are introducing a hierarchical 'programming with nets' method which is currently implemented in the high-level Petri net editor of the tool.

show abstract

Section: M-netsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Combining finite automata, parallel programs and SDL using Petri nets

Grahlmann

1998

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…In (Kindler, 1996) the composition of Petri net components is modelled with place fusion, which corresponds to asynchronous message passing. In (Best et al, 1995) large High Level nets are constructed from smaller components, by transition synchronisation, which allows composition in a manner similar to process algebras like CCS. We use Coloured Petri nets which allow the modeller to create simple and easily manageable descriptions, without losing the ability of formal analysis (Jensen, 1990).…”

Section: Composition Of Specifications Supporting Ensemblementioning

confidence: 99%

Specification composition for the verification of message passing program composition

Cotronis

Tsiatsoulis

1997

Reliability, Quality and Safety of Software-Intensive Systems

View full text Add to dashboard Cite

We present a specification composition technique which supports the message passing composition of applications by the Ensemble methodology. In Ensemble applications are built by composing reusable executable program components designed with scalable communication interfaces. We define reusable specifications of program components, using coloured Petri nets, which are then composed to obtain the specification of the application. The composition is controlled by the same script that is used to compose the application.

show abstract

“…High-level (HL) PN, called M-nets [5], on which an alternative net semantics of B(PN) 2 programs is based [4] can be edited.…”

mentioning

confidence: 99%

The reference component of PEP

Grahlmann

1997

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

The PEP tool is a Programming Environment based on Petri Nets. Sophisticated programming and verification components are embedded in a user-friendly graphical interface. The basic idea is that the programming component allows the user to design concurrent algorithms in an easy-to-use imperative language, and that the PEP system then generates Petri nets from such programs in order to use Petri net theory for simulation and verification purposes. The main focus of this paper is the reference component which represents the bridge between these two worlds. We integrate references in the formal semantics and present some of the provided features. Among others the simulation of a parallel program can be triggered through the simulation of a Petri net. Program formulae can be transformed automatically into net formulae which can then be an input for the verification component. PEP has been implemented on Solaris 2.x, SunOS 4.1.x and Linux. Ftpable versions are available via www. informatik, uni-hildesheim, de/~pep.

show abstract

A class of composable high level Petri nets

Cited by 35 publications

References 13 publications

Combining finite automata, parallel programs and SDL using Petri nets

Combining finite automata, parallel programs and SDL using Petri nets

Specification composition for the verification of message passing program composition

The reference component of PEP

Contact Info

Product

Resources

About