PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

CospanSpan(Graph) : a Compositional Description of the Heart System

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper, we recall the basic features of the CospanSpan(Graph) algebra for the compositional description of reconfigurable hierarchical networks. In particular, we focus on compositionality and on the possibility of describing the interactions among physical/biological systems, using a parallel with communication operation not considered in the usual Kleene’s algebra. As a novel application, we give a complete compositional description in Span(Graph) of a simplified version of the heart system.
Słowa kluczowe
Wydawca
Rocznik
Strony
221--237
Opis fizyczny
Bibliogr. 13 poz., rys.
Twórcy
  • Faculty of Computer Science, Free University of Bozen-Bolzano, Italy
  • Dipartimento di Matematica, Università degli studi di Milano, Italy
  • Dipartimento di Scienza ed Alta Tecnologia, Università degli Studi dell'Insubria, Italy
  • Dipartimento di Scienza ed Alta Tecnologia, Università degli Studi dell'Insubria, Italy
  • Faculty of Informatics, Università della Svizzera Italiana, Switzerland
autor
  • Dipartimento di Scienza ed Alta Tecnologia, Università degli Studi dell'Insubria, Italy
Bibliografia
  • [1] Besozzi D, Mauri G, Păun G, Zandron C. Gemmating P systems: collapsing hierarchies. Theor. Comput. Sci., 2003. 296(2):253-267. URL https://doi.org/10.1016/S0304-3975(02)00657-6.
  • [2] Martín-Vide C, GMauri, Paun G, Rozenberg G, Salomaa A (eds.). Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain, July 17-22, 2003, Revised Papers, volume 2933 of Lecture Notes in Computer Science. Springer, 2004. ISBN-978-3-540-20895-2, 0302-9743. doi:10.1007/b95207.
  • [3] Ferretti C, Mauri G, Zandron C (eds.). DNA Computing, 10th International Workshop on DNA Computing, DNA 10, Milan, Italy, June 7-10, 2004, Revised Selected Papers, volume 3384. Springer, 2005. doi:10.1007/b136914.
  • [4] Katis P, Sabadini N, Walters RFC. Span(Graph): A Categorial Algebra of Transition Systems. In: Proc. of AMAST. 1997 pp. 307-321. doi:10.1007/BFb0000479.
  • [5] Katis P, Sabadini N, Walters R. A Formalization of the IWIM Model. In: Proc. of Coordination Languages and Models, volume 1906 of LNCS. Springer. 2000 pp. 267-283. ISBN-978-3-540-41020-1.
  • [6] Sabadini N, Walters RFC. Hierarchical Automata and P-systems. Electr. Notes Theor. Comput. Sci., 2003. 78:5-19. URL https://doi.org/10.1016/S1571-0661(04)81003-X.
  • [7] de Francesco Albasini L, Sabadini N, Walters RFC. The Compositional Construction of Markov Processes. Applied Categorical Structures, 2011. 19(1):425-437. doi:10.1007/s10485-010-9233-0.
  • [8] Cherubini A, Sabadini N, Walters RFC. Timing in the Cospan-Span Model. Electr. Notes Theor. Comput. Sci., 2004. 104:81-97. doi:10.1016/j.entcs.2004.08.020.
  • [9] Jiang Z, Pajic M, Moarref S, Alur R, Mangharam R. Modeling and Verification of a Dual Chamber Implantable Pacemaker. In: Proc. of TACAS. 2012 pp. 188-203. doi:10.1007/978-3-642-28756-5_14.
  • [10] Bènabou J. Introduction to Bicategories. Reports of the Midwest Category Seminar, 1967. 47:1-77. doi:10.1007/BFb0074299.
  • [11] Gianola A, Kasangian S, Sabadini N. Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks. In: Proc. of CALCO. 2017 pp. 2:1-2:17. doi:10.4230/LIPIcs.CALCO.2017.2.
  • [12] Sabadini N, Schiavio F, Walters R. On the geometry and algebra of networks with state. Theor. Comput. Sci., 2017. 664:144-163. URL https://doi.org/10.1016/j.tcs.2016.01.028.
  • [13] Zielonka W. Notes on Finite Asynchronous Automata. ITA, 1987. 21(2):99-135. URL https://doi.org/10.1051/ita/1987210200991.
Uwagi
Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-ecb92f69-f164-4b10-9737-74ae966008fb
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.