Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Foundations for the study of software architecture
ACM SIGSOFT Software Engineering Notes
Categorical semantics of parallel program design
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Dynamic connectors for concurrency
Theoretical Computer Science
Normal forms for algebras of connections
Theoretical Computer Science
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
The Algebra of Connectors—Structuring Interaction in BIP
IEEE Transactions on Computers
Recent Trends in Algebraic Development Techniques
Causal semantics for the algebra of connectors
Formal Methods in System Design
Representations of Petri net interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Specifying software connectors
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 0.00 |
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.