Observational congruences for dynamically reconfigurable tile systems
From MaRDI portal
Publication:1782000
DOI10.1016/j.tcs.2004.10.044zbMath1080.68075OpenAlexW2083127081MaRDI QIDQ1782000
Ugo Montanari, Roberto Bruni, Vladimiro Sassone
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
Related Items (1)
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
- 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
This page was built for publication: Observational congruences for dynamically reconfigurable tile systems
