A Normal Form for Stateful Connectors
From MaRDI portal
Publication:2945707
DOI10.1007/978-3-319-23165-5_9zbMath1321.68357OpenAlexW2296258968MaRDI QIDQ2945707
Roberto Bruni, Hernán Melgratti, Ugo Montanari
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/769911
Uses Software
Cites Work
- Unnamed Item
- A basic algebra of stateless connectors
- Petri nets are monoids
- Functorial models for Petri nets
- Axiomatizing the algebra of net computations and processes
- On the category of props
- Full Abstraction for Signal Flow Graphs
- Connector algebras for C/E and P/T nets' interactions
- A Connector Algebra for P/T Nets Interactions
- Tiles for Reo
- A Categorical Semantics of Signal Flow Graphs
- Connector Algebras, Petri Nets, and BIP
- Representations of Petri Net Interactions
- Three Partition Refinement Algorithms
- On the semantics of place/transition Petri nets
- Compositional semantics for open Petri nets based on deterministic processes
- Reo: a channel-based coordination model for component composition
- Behaviour, Interaction and Dynamics
- Categorical algebra
This page was built for publication: A Normal Form for Stateful Connectors