Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
A Connector Algebra for P/T Nets Interactions
verfasst von : Roberto Bruni, Hernán Melgratti, Ugo Montanari
Erschienen in: CONCUR 2011 – Concurrency Theory
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.