Normal forms for algebras of connections.
From MaRDI portal
Publication:1853455
DOI10.1016/S0304-3975(01)00318-8zbMath1061.68110MaRDI QIDQ1853455
Ugo Montanari, Fabio Gadducci, Roberto Bruni
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q65: Abstract data types; algebraic specification
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Petri Nets Are Dioids, An axiomatization of graphs, A basic algebra of stateless connectors, Dynamic connectors for concurrency, Models of Computation: A Tribute to Ugo Montanari’s Vision, Calculating Colimits Compositionally, A Decentralized Implementation of Mobile Ambients
Uses Software
Cites Work
- An axiomatization of the algebra of Petri net concatenable processes
- Bicategories of processes
- On flowchart theories. II: The nondeterministic case
- Categories of partial maps
- Classes of finite relations as initial abstract data types. I
- Maude: specification and programming in rewriting logic
- LEAN: An intermediate language based on graph rewriting
- Tile formats for located and mobile systems.
- Calculi for interaction
- Axiomatizing the algebra of net computations and processes
- Contextual nets
- An algebraic presentation of term graphs, via gs-monoidal categories
- Graph rewriting, constraint solving and tiles for coordinating distributed systems
- Premonoidal categories and notions of computation
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item