Dynamic connectors for concurrency
type: Item
instance of: scholarly article
title: Dynamic connectors for concurrency
zbMATH Open document ID: 0996.68073
DOI: 10.1016/S0304-3975(02)00011-7
author: Roberto Bruni
author: Ugo Montanari
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1767891
zbMATH Keywords: distributed systems
zbMATH Keywords: concurrent and causal semantics
zbMATH Keywords: tile logic
zbMATH Keywords: algebras of connectors
zbMATH Keywords: wirings
zbMATH Keywords: process rewrite systems
zbMATH Keywords: basic parallel processes
describes a project that uses: CafeOBJ
describes a project that uses: Maude
MaRDI profile type: Publication
cites work: A calculus for cryptographic protocols: The spi calculus
cites work: Mobile Petri nets
cites work: LEAN: An intermediate language based on graph rewriting
cites work: Algebra of communicating processes with abstraction
cites work: The chemical abstract machine
cites work: Bisimulation can't be traced
cites work: Flow models of distributed computations: Three equivalent semantics for CCS
cites work: Observing localities
cites work: A theory of processes with localities
cites work: Q4536607
cites work: Q4941924
cites work: Normal forms for algebras of connections.
cites work: Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
cites work: Zero-safe nets: Comparing the collective and individual token approaches.
cites work: Q4536441
cites work: Q2769427
cites work: Bicategories of spans and relations
cites work: Cartesian bicategories. I
cites work: Mobile ambients
cites work: Q3485876
cites work: Classes of finite relations as initial abstract data types. I
cites work: Q4362962
cites work: An algebraic presentation of term graphs, via gs-monoidal categories
cites work: Q4941927
cites work: Compositional SOS and beyond: A coalgebraic view of open systems
cites work: Refinement of actions in event structures and causal trees
cites work: Higher-level synchronising devices in Meije-SCCS
cites work: Proved trees
cites work: CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
cites work: Catégories structurées
cites work: Q5608062
cites work: Tile formats for located and mobile systems.
cites work: A calculus of mobile agents
cites work: Coalgebras and cartesian categories
cites work: Q4499230
cites work: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
cites work: Closed action calculi
cites work: Configuration structures, event structures and Petri nets
cites work: Structured operational semantics and bisimulation as a congruence
cites work: Q3024908
cites work: Q3953956
cites work: Elementary structures in process theory (1): Sets with renaming
cites work: Bicategories of processes
cites work: Q4373555
cites work: Comparing locality and causality based equivalences
cites work: Q5714438
cites work: Interaction combinators
cites work: Q4038716
cites work: FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
cites work: Q4251913
cites work: Process rewrite systems.
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Q3839051
cites work: Q3839052
cites work: Calculi for interaction
cites work: A calculus of mobile processes. II
cites work: Q4222946
cites work: Location equivalence in a parametric setting

Dynamic connectors for concurrency (cites work)
cites work: Q4090505

Dynamic connectors for concurrency (cites work)
cites work: Premonoidal categories and notions of computation

Dynamic connectors for concurrency (cites work)
cites work: Bisimilarity of open terms.

Dynamic connectors for concurrency (cites work)
cites work: Categories of partial maps

Dynamic connectors for concurrency (cites work)
cites work: Q4492940