B. Koenig and U. Montanari. Observational equivalence for synchronized graph rewriting. In Proc. TACS'01, LNCS. Springer Verlag, 2001. To appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Appligraph: Applications of Graph Transformation - Fifth.. - Kreowski, (eds.) (2002) (Correct)
....taken into account. The same thesis also contains a number of examples where the decomposition techniques for Local Action Systems are used to provide formal correctness proof of distributed systems. The examples include a distributed shortest path algorithm and a simple transport protocol. In [KM01] a notion of bisimulation for graph rewriting systems is introduced, allowing one to prove observational equivalence for dynamically evolving graphs and networks. This notion is applied to the framework of synchronized graph rewriting with mobility which is describe in two di er18 ent, but ....
B. Konig and U. Montanari. Observational equivalence for synchronized graph rewriting. In N. Kobayashi and B. Pierce, editors, Proc. TACS 2001, volume 2215 of Lecture Notes in Computer Science, pages 145-164. Springer, 2001.
A Formal Basis for Reasoning on Programmable QoS - De Nicola, Ferrari.. (2003) Self-citation (Montanari) (Correct)
No context found.
B. Koenig and U. Montanari. Observational equivalence for synchronized graph rewriting. In Proc. TACS'01, LNCS. Springer Verlag, 2001. To appear.
A Graphical Calculus for Name Mobility - Hirsch, Montanari (2 citations) Self-citation (Montanari) (Correct)
....judgements and present the transition system for Hoare synchronization (a presentation for Milner synchronization can be found in [2] It is worth notice that to implement other synchronization algebras it is only needed to change the corresponding transition system. We can also mention that [3] presents a bisimilarity for synchronized graph rewriting with name mobility (based on the work of [1] proving it to be a congruence. Also they introduce a so called format which is a syntactic condition on productions ensuring that bisimilarity is a congruence. This last result is original not ....
Konig, B. and Montanari, U. Observational equivalence for synchronized graph rewriting with mobility. Submitted, 2001.
Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) (Correct)
No context found.
B. Konig and U. Montanari. Observational equivalence for synchronized graph rewriting. In N. Kobayashi and B. Pierce, editors, Proc. TACS 2001, volume 2215 of Lecture Notes in Computer Science, pages 145-164. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC