Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Combining finite automata, parallel programs and SDL using Petri nets
| |
|
Regular Sessions
Design and Architecture
Combining finite automata, parallel programs and SDL using Petri nets
Bernd Grahlmann1 
| (1) |
Institut für Informatik, Universität Hildesheim, Maxienburger Platz 22, D-31141 Hildesheim |
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 re-Quest) 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.
Keywords B(PN)2 - Finite automata - Hybrid system design - M-nets - Parallel programs - PEP - Petri nets - SDL - Verification
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|