Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Stochastic nets and performance evaluation
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Communication and Concurrency
Implementing a Stochastic Process Algebra within the Möbius Modeling Framework
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Towards a Modular Analysis of Coloured Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
sPBC: A Markovian Extension of Finite Petri Box Calculus
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Möbius: Framework and Atomic Models
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Two approaches to integrating UML and performance models
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
PEPA nets: a structured performance modelling formalism
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Hi-index | 0.02 |
We introduce a graphically based formalism for parallel system designs, covering both functional and stochastic behaviour. This paper focuses on the combination in one formalism of characteristics of two major approaches to formalisms for concurrent systems, namely Process Algebras and Petri Nets. We define a general form of composition on nets with stochastic delays for transitions. This incorporates place and transition fusion. Then, following the general method of CCS, we define inference rules for deriving the behaviour of a composed net from the behaviour of its components. We give a number of examples to illustrate this synthesis of Petri Nets and Process Algebras.