Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Space-time deterministic graph rewriting (2404.05838v2)

Published 8 Apr 2024 in cs.DM, cs.DC, gr-qc, math.DS, and nlin.CG

Abstract: We study non-terminating graph rewriting models, whose local rules are applied non-deterministically -- and yet enjoy a strong form of determinism, namely space-time determinism. Of course in the case of terminating computation it is well-known that the mess introduced by asynchronous rule applications may not matter to the end result, as confluence conspires to produce a unique normal form. In the context of non-terminating computation however, confluence is a very weak property, and (almost) synchronous rule applications is always preferred e.g. when it comes to simulating dynamical systems. Here we provide sufficient conditions so that asynchronous local rule applications conspire to produce well-determined events in the space-time unfolding of the graph, regardless of their application orders. Our first example is an asynchronous simulation of a dynamical system. Our second example features time dilation, in the spirit of general relativity.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. K. Zuse. Rechnender Raum. Elektronische Datenverarbeitung. English Translation: Calculating Space, MIT Tech. Translation, 8:336–344, 1967.
  2. D. A. Wolf-Gladrow. Lattice-Gas Cellular Automata and Lattice Boltzmann Models. In Lecture Notes in Mathematics. Springer, 2000.
  3. B. Chopard and M. Droz. Cellular automata modeling of physical systems. Cambridge University Press New York, 1998.
  4. D.H. Rothman and S. Zaleski. Lattice-gas cellular automata: simple models of complex hydrodynamics. Cambridge University Press, 1997.
  5. K. Nagel and M. Schreckenberg. A cellular automaton model for freeway traffic. J. Phys. I France, 2:2221–2229, 1992.
  6. C. Bruun. A model of consumption behaviour using cellular automata. Aalborg University, 1996.
  7. R. White and G. Engelen. Cellular automata as the basis of integrated dynamic regional modelling. Environment and Planning B, 24:235–246, 1997.
  8. Lattice gas simulations of dynamical geometry in two dimensions. Phys. Rev. E., 82(4):046705, Oct 2010.
  9. C. Papazian and E. Remila. Hyperbolic recognition by graph automata. In Automata, languages and programming: 29th international colloquium, ICALP 2002, Málaga, Spain, July 8-13, 2002: proceedings, volume 2380, page 330. Springer Verlag, 2002.
  10. James Dickson Murray. Mathematical biology. ii: Spatial models and biomedical applications. In Biomathematics, volume 18. Springer Verlag, third edition, 2003.
  11. Consensus formation on adaptive networks. Phys. Rev. E, 77:016102, Jan 2008.
  12. Around probabilistic cellular automata. Theoretical Computer Science, 559:42–72, 2014. Non-uniform Cellular Automata.
  13. Parallelism of manipulations in multidimensional information structures. In Antoni Mazurkiewicz, editor, Mathematical Foundations of Computer Science 1976, pages 284–293, Berlin, Heidelberg, 1976. Springer Berlin Heidelberg.
  14. Efficient conflict detection in graph transformation systems by essential critical pairs. Electronic Notes in Theoretical Computer Science, 211:17–26, 2008. Proceedings of the Fifth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2006).
  15. Checking graph programs for confluence. In Software Technologies: Applications and Foundations: STAF 2017 Collocated Workshops, Marburg, Germany, July 17-21, 2017, Revised Selected Papers, pages 92–108. Springer, 2018.
  16. Confluence of graph rewriting with interfaces. In Hongseok Yang, editor, Programming Languages and Systems, pages 141–169, Berlin, Heidelberg, 2017. Springer Berlin Heidelberg.
  17. Unification of drags and confluence of drag rewriting. Journal of Logical and Algebraic Methods in Programming, 131:100845, 2023.
  18. Synchronism versus asynchronism in monotonic boolean automata networks. Natural Computing, 17:393–402, 2018.
  19. Boolean networks: Beyond generalized asynchronicity. In Jan M. Baetens and Martin Kutrib, editors, Cellular Automata and Discrete Complex Systems, pages 29–42, Cham, 2018. Springer International Publishing.
  20. Birgitt Schönfisch and André de Roos. Synchronous and asynchronous updating in cellular automata. Biosystems, 51(3):123–143, 1999.
  21. Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoretical Computer Science, 362(1):1–16, 2006.
  22. R. Sorkin. Time-evolution problem in Regge calculus. Phys. Rev. D., 12(2):385–396, 1975.
  23. Fundamentals of compositional rewriting theory. Journal of Logical and Algebraic Methods in Programming, 135:100893, 2023.
  24. On quantum superpositions of graphs. arXiv preprint arXiv:2010.13579, 2020.
  25. Peter Gács. Deterministic computations whose history is independent of the order of asynchronous updating. arXiv preprint cs/0101026, 2001.
  26. Chrystopher L Nehaniv. Asynchronous automata networks can emulate any synchronous automata network. International Journal of Algebra and Computation, 14(05n06):719–739, 2004.
  27. G. Rozenberg. Handbook of graph grammars and computing by graph transformation: Foundations, volume 1. World Scientific, 2003.
  28. Fundamentals of algebraic graph transformation. Springer-Verlag New York Inc, 2006.
  29. M. Löwe. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science, 109(1-2):181–224, 1993.
  30. G. Taentzer. Parallel and distributed graph transformation: Formal description and application to communication-based systems. PhD thesis, Technische Universitat Berlin, 1996.
  31. Thierry Boy de la Tour and Rachid Echahed. Parallel coherent graph transformations. In Recent Trends in Algebraic Development Techniques: 25th International Workshop, WADT 2020, Virtual Event, April 29, 2020, Revised Selected Papers 25, pages 75–97. Springer, 2021.
  32. Unfolding grammars in adhesive categories. In Alexander Kurz, Marina Lenisa, and Andrzej Tarlecki, editors, Algebra and Coalgebra in Computer Science, pages 350–366, Berlin, Heidelberg, 2009. Springer Berlin Heidelberg.
  33. Stochastic mechanics of graph rewriting. In 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–10. IEEE, 2016.
  34. Processes and unfoldings: concurrent computations in adhesive categories. Mathematical Structures in Computer Science, 24(4):240402, 2014.
  35. Unfolding graph grammars with negative application conditions. In Graph Transformation: 12th International Conference, ICGT 2019, Held as Part of STAF 2019, Eindhoven, The Netherlands, July 15–16, 2019, Proceedings 12, pages 93–110. Springer, 2019.
  36. Cellular automata over generalized Cayley graphs. Mathematical Structures in Computer Science, 18:340–383, 2018. Pre-print arXiv:1212.0027.
  37. Graph subshifts. In Gianluca Della Vedova, Besik Dundua, Steffen Lempp, and Florin Manea, editors, Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings, volume 13967 of Lecture Notes in Computer Science, pages 261–274. Springer, 2023.
  38. L. Maignan and A. Spicher. Global graph transformations. In Proceedings of the 6th International Workshop on Graph Computation Models, L’Aquila, Italy, July 20, 2015., pages 34–49, 2015.
  39. Naomi Nishimura. Efficient asynchronous simulation of a class of synchronous parallel algorithms. Journal of Computer and System Sciences, 50(1):98–113, 1995.
  40. Jonathan Gorard. Some relativistic and gravitational properties of the wolfram model. arXiv preprint arXiv:2004.14810, 2020.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now