Tile formats for located and mobile systems.

DOI10.1006/INCO.1999.2825zbMath1046.68619OpenAlexW1984882019MaRDI QIDQ1854326

Ugo Montanari, Gian-Luigi Ferrari

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2825

zbMATH Keywords

\(\pi\)-calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Rewriting logic: Roadmap and bibliography ⋮ Linear-Ordered Graph Grammars: Applications to Distributed Systems Design ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ Observational congruences for dynamically reconfigurable tile systems ⋮ 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 ⋮ Normal forms for algebras of connections. ⋮ Dynamic connectors for concurrency ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

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
• Location equivalence in a parametric setting
• Structural operational semantics for weak bisimulations
• On the implementation of concurrent calculi in net calculi: two case studies
• Observing localities
• Higher-level synchronising devices in Meije-SCCS
• Conditional rewriting logic as a unified model of concurrency
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• Iteration theories of synchronization trees
• On bisimulations for the asynchronous \(\pi\)-calculus
• Plain CHOCS. A second generation calculus for higher order processes
• Turning SOS rules into equations
• Flow models of distributed computations: Three equivalent semantics for CCS
• Comparing locality and causality based equivalences
• Objects in the \(\pi\)-calculus
• Axiomatizing the algebra of net computations and processes
• Trace nets and process automata
• An algebraic presentation of term graphs, via gs-monoidal categories
• CPO models for compact GSOS languages
• Compositionality Through an Operational Semantics of Contexts
• Bisimulation can't be traced
• Distribution and locality of concurrent systems
• Axiomatizing permutation equivalence
• Relating two categorical models of term rewriting
• Catégories structurées
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

This page was built for publication: Tile formats for located and mobile systems.