Observational congruences for dynamically reconfigurable tile systems

DOI10.1016/j.tcs.2004.10.044zbMath1080.68075MaRDI QIDQ1782000

Ugo Montanari, Vladimiro Sassone, Roberto Bruni

Publication date: 10 June 2005

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

Full work available at URL: https://eprints.soton.ac.uk/261844/1/tdbTCSOff.pdf

zbMATH Keywords

Bisimulation; \(\pi\)-Calculus; Dynamic bisimulation; SOS formats; Tile logic

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Cites Work

• Higher-level synchronising devices in Meije-SCCS
• A calculus of communicating systems
• Conditional rewriting logic as a unified model of concurrency
• The chemical abstract machine
• A calculus of mobile processes. I
• Structured operational semantics and bisimulation as a congruence
• An algebraic semantics for structured transition systems and its application to logic programs
• Testing equivalences for processes
• Dynamic connectors for concurrency
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Tile formats for located and mobile systems.
• Bisimilarity of open terms.
• A theory of bisimulation for the \(\pi\)-calculus
• Deriving Bisimulation Congruences: A 2-categorical Approach
• Bisimulation by Unification*
• Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
• Bisimulation can't be traced
• An interactive semantics of logic programming
• Foundations of Software Science and Computation Structures
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• A calculus of mobile agents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item