Dynamic connectors for concurrency
From MaRDI portal
Publication:1603689
DOI10.1016/S0304-3975(02)00011-7zbMath0996.68073MaRDI QIDQ1603689
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
distributed systemsbasic parallel processesprocess rewrite systemsalgebras of connectorsconcurrent and causal semanticstile logicwirings
Related Items
Linear-Ordered Graph Grammars: Applications to Distributed Systems Design, Models of Computation: A Tribute to Ugo Montanari’s Vision, Unnamed Item, Revisiting causality, coalgebraically, Observational congruences for dynamically reconfigurable tile systems, A Connector Algebra for P/T Nets Interactions
Uses Software
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
- Location equivalence in a parametric setting
- Bicategories of processes
- Observing localities
- Refinement of actions in event structures and causal trees
- Configuration structures, event structures and Petri nets
- Bicategories of spans and relations
- Algebra of communicating processes with abstraction
- Higher-level synchronising devices in Meije-SCCS
- Cartesian bicategories. I
- Categories of partial maps
- Classes of finite relations as initial abstract data types. I
- Conditional rewriting logic as a unified model of concurrency
- The chemical abstract machine
- A calculus of mobile processes. II
- Structured operational semantics and bisimulation as a congruence
- A calculus for cryptographic protocols: The spi calculus
- A theory of processes with localities
- Flow models of distributed computations: Three equivalent semantics for CCS
- Comparing locality and causality based equivalences
- Interaction combinators
- Mobile ambients
- Closed action calculi
- Compositional SOS and beyond: A coalgebraic view of open systems
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- LEAN: An intermediate language based on graph rewriting
- Normal forms for algebras of connections.
- Zero-safe nets: Comparing the collective and individual token approaches.
- Tile formats for located and mobile systems.
- Process rewrite systems.
- Bisimilarity of open terms.
- Calculi for interaction
- An algebraic presentation of term graphs, via gs-monoidal categories
- Mobile Petri nets
- Coalgebras and cartesian categories
- Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
- Premonoidal categories and notions of computation
- Bisimulation can't be traced
- Elementary structures in process theory (1): Sets with renaming
- Proved trees
- Catégories structurées
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- A calculus of mobile agents
