Combining Finite Automata, Parallel Programs and SDL Using Petri Nets

摘要

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.