Normal forms for algebras of connections.

DOI10.1016/S0304-3975(01)00318-8zbMath1061.68110MaRDI QIDQ1853455

Roberto Bruni, Ugo Montanari, Fabio Gadducci

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Concurrent and distributed systemsDiagrammatic specification techniquesGraphical formalisms

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A Term-Graph Syntax for Algebras over Multisets, A basic algebra of stateless connectors, A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA)., Discretionary Information Flow Control for Interaction-Oriented Specifications, Drags: a compositional algebraic framework for graph rewriting, A decentralised graphical implementation of mobile ambients, Models of Computation: A Tribute to Ugo Montanari’s Vision, Calculating Colimits Compositionally, Petri nets are dioids: a new algebraic foundation for non-deterministic net theory, Confluence of Graph Rewriting with Interfaces, A Decentralized Implementation of Mobile Ambients, Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks, GETGRATS, An axiomatization of graphs, On GS-Monoidal Theories for Graphs with Nesting, A Connector Algebra for P/T Nets Interactions, Comparing cospan-spans and tiles via a Hoare-style process calculus, A categorical framework for typing CCS-style process communication, GS·Λ Theories, Petri Nets Are Dioids, Corelations are the prop for extraspecial commutative Frobenius monoids, Dynamic connectors for concurrency

Uses Software

• Maude

Cites Work

• 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
• 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