A Connector Algebra for P/T Nets Interactions

ROBERTO BRUNI; HERNÁN MELGRATTI; UGO MONTANARI

LECTURE NOTES IN COMPUTER SCIENCE

Springer

Año: 2011 vol. 6901 p. 312 - 326

0302-9743

A quite flourishing research thread in the recent literature on component-based system is concerned with the algebraic properties of various kinds of connectors for defining well-engineered systems. In a recent paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, plus their duals. The connectors can be composed in series or in parallel and employing a simple 1-state buffer they can model the coordination language Reo. Pawel Sobocinski employed essentially the same stateful extension of connector algebra to provide semantics-preserving mutual encoding with some sort of elementary Petri nets with boundaries. In this paper we show how the tile model can be used to extend Sobocinski’s approach to deal with P/T nets, thus paving the way towards more expressive connector models.