Network Applications of Graph Bisimulation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 2044490 (Why is no real title available?)
- scientific article; zbMATH DE number 1927579 (Why is no real title available?)
- scientific article; zbMATH DE number 1759615 (Why is no real title available?)
- scientific article; zbMATH DE number 1863157 (Why is no real title available?)
- scientific article; zbMATH DE number 1863162 (Why is no real title available?)
- scientific article; zbMATH DE number 2242585 (Why is no real title available?)
- A calculus of mobile processes. I
- A graphical fusion calculus
- Ambient graph rewriting
- Distributed processes and location failures
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computational Structures
- Mobile ambients
- Rational unification in 28 characters
Cited in
(7)- Network simulation environment (NSE): A generic framework for network graphs
- Application of bipartite graphs for achieving race-free state assignments
- Graph-based models of internetworking systems.
- Visualisation and simulation with object-oriented networks
- Bisimulations on Data Graphs
- scientific article; zbMATH DE number 2242585 (Why is no real title available?)
- Depletable channels: dynamics, behaviour, and efficiency in network design
This page was built for publication: Network Applications of Graph Bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540393)