Article

Observational Equivalence for Synchronized Graph Rewriting with Mobility

Authors:

Barbara König,

Ugo MontanariAuthors Info & Claims

TACS '01: Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software

Pages 145 - 164

Published: 29 October 2001 Publication History

Abstract

We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks.We use the framework of synchronized graph rewriting with mobility which we describe in two different, but operationally equivalent ways: on graphs defined as syntactic judgements and by using tile logic. One of the main results of the paper says that bisimilarity for synchronized graph rewriting is a congruence whenever the rewriting rules satisfy the basic source property. Furthermore we introduce an up-to technique simplifying bisimilarity proofs and use it in an example to show the equivalence of a communication network and its specification.

References

[1]

R. Bruni, D. Frutos-Escrig, N. Martí-Oliet, and U. Montanari. Bisimilarity congruences for open terms and term graphs via tile logic. In Proc. of CONCUR 2000 , pages 259-274. Springer-Verlag, 2000. LNCS 1877.

[2]

R. Bruni, D. Frutos-Escrig, N. Martí-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Dipartimento di Informatica, Università di Pisa, 2000.

[3]

Roberto Bruni, Fabio Gadducci, and Ugo Montanari. Normal forms for partitions and relations. In Recents Trends in Algebraic Development Techniques, 12th International Workshop, WADT '98 , pages 31-47. Springer-Verlag, 1998. LNCS 1589, full version to appear in TCS.

[4]

Gnanamalar David, Frank Drewes, and Hans-Jörg Kreowski. Hyperedge replacement with rendezvous. In Proc. of TAPSOFT (Theory and Practice of Software Development) , pages 167-181. Springer-Verlag, 1993. LNCS 668.

[5]

Roberto de Simone. Higher level synchronizing devices in MEIJE-SCCS. Theoretical Computer Science , 37:245-267, 1985.

[6]

P. Degano and U. Montanari. A model of distributed systems based on graph rewriting. Journal of the ACM , 2(34):411-449, 1987.

[7]

H. Ehrig. Introduction to the algebraic theory of graphs. In Proc. 1st International Workshop on Graph Grammars , pages 1-69. Springer-Verlag, 1979. LNCS 73.

[8]

H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution . World Scientific, 1999.

[9]

Maribel Fernándezand Ian Mackie. Coinductive techniques for operational equivalence of interaction nets. In Proc. of LICS '98 . IEEE Computer Society Press, 1998.

[10]

F. Gadducci and R. Heckel. An inductive view of graph transformation. In Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT '97 , pages 223-237. Springer-Verlag, 1997. LNCS 1376.

[11]

F. Gadducci and U. Montanari. The tile model. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner . MIT Press, 1999.

[12]

J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation , 100:202-260, 1992.

[13]

Dan Hirsch, Paola Inverardi, and Ugo Montanari. Reconfiguration of software architecture styles with name mobility. In António Porto and Gruia-Catalin Roman, editors, Proc. of COORDINATION 2000 , pages 148-163. Springer-Verlag, 2000. LNCS 1906.

[14]

Dan Hirsch and Ugo Montanari. Synchronized hyperedge replacement with name mobility (a graphical calculus for mobile systems). In Proc. of CONCUR '01 . Springer-Verlag, 2001. to appear.

[15]

Barbara König. Description and Verification of Mobile Processes with Graph Rewriting Techniques . PhD thesis, Technische Universität München, 1999.

[16]

Barbara König. A graph rewriting semantics for the polyadic pi-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops '00 , pages 451-458. Carleton Scientific, 2000.

[17]

James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000 , 2000. LNCS 1877.

[18]

R. Milner and D. Sangiorgi. Techniques of weak bisimulation up-to. In Proc. of CONCUR '92 . Springer-Verlag, 1992. LNCS 630.

[19]

Robin Milner. A Calculus of Communicating Systems . Springer-Verlag, 1980. LNCS 92.

[20]

Robin Milner. Calculi for interaction. Acta Informatica , 33(8):707-737, 1996.

[21]

Robin Milner. Communicating and Mobile Systems: the ¿-Calculus . Cambridge University Press, 1999.

[22]

Robin Milner and Davide Sangiorgi. Barbed bisimulation. In Proc. of ICALP '92 . Springer-Verlag, 1992. LNCS 623.

[23]

U. Montanari and F. Rossi. Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures , 7:333-370, 1999.

[24]

Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations , volume 1. World Scientific, 1997.

[25]

Nobuko Yoshida. Graph notation for concurrent combinators. In Proc. of TPPP '94 . Springer-Verlag, 1994. LNCS 907.

Cited By

Jiang YLiu SEhrhard T(2019)A fully abstract semantics for value-passing CCS for treesFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-018-7069-113:4(828-849)Online publication date: 17-Jul-2019
https://dl.acm.org/doi/10.1007/s11704-018-7069-1
Bruni RMelgratti HMontanari U(2011)Connector algebras, petri nets, and BIPProceedings of the 8th international conference on Perspectives of System Informatics10.1007/978-3-642-29709-0_2(19-38)Online publication date: 27-Jun-2011
https://dl.acm.org/doi/10.1007/978-3-642-29709-0_2
Lanese IMontanari U(2007)Mapping Fusion and Synchronized Hyperedge Replacement into logic programmingTheory and Practice of Logic Programming10.1017/S147106840600281X7:1-2(123-151)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1017/S147106840600281X
Show More Cited By

Index Terms

Observational Equivalence for Synchronized Graph Rewriting with Mobility
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems

Index terms have been assigned to the content through auto-classification.

Recommendations

Rewriting with Equivalence Relations in ACL2

Traditionally, a conditional rewrite rule directs replacement of one term by another term that is provably equal to it, perhaps under some hypotheses. This paper generalizes the notion of rewrite rule to permit the connecting relation to be merely an ...
Linking algebraic observational equivalence and bisimulation
DLT'10: Proceedings of the 14th international conference on Developments in language theory

Observability concepts allow to focus on the observable behaviour of a system while abstracting internal details of implementation. In this context, formal verification techniques use behavioural equivalence notions formalizing the idea of ...
Automated Symbolic Proofs of Observational Equivalence
CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security

Many cryptographic security definitions can be naturally formulated as observational equivalence properties. However, existing automated tools for verifying the observational equivalence of cryptographic protocols are limited: they do not handle ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

TACS '01: Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software

October 2001

560 pages

ISBN:3540427368

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 October 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jiang YLiu SEhrhard T(2019)A fully abstract semantics for value-passing CCS for treesFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-018-7069-113:4(828-849)Online publication date: 17-Jul-2019
https://dl.acm.org/doi/10.1007/s11704-018-7069-1
Bruni RMelgratti HMontanari U(2011)Connector algebras, petri nets, and BIPProceedings of the 8th international conference on Perspectives of System Informatics10.1007/978-3-642-29709-0_2(19-38)Online publication date: 27-Jun-2011
https://dl.acm.org/doi/10.1007/978-3-642-29709-0_2
Lanese IMontanari U(2007)Mapping Fusion and Synchronized Hyperedge Replacement into logic programmingTheory and Practice of Logic Programming10.1017/S147106840600281X7:1-2(123-151)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1017/S147106840600281X
Ferrari GHirsch DLanese IMontanari UTuosto E(2005)Synchronised hyperedge replacement as a model for service oriented computingProceedings of the 4th international conference on Formal Methods for Components and Objects10.1007/11804192_2(22-43)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1007/11804192_2

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents