{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:10:19Z","timestamp":1737436219043,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003151"},{"type":"electronic","value":"9783540362807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36280-0_14","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:16:50Z","timestamp":1187248610000},"page":"197-211","source":"Crossref","is-referenced-by-count":1,"title":["Interactive Systems: From Folklore to Mathematics"],"prefix":"10.1007","author":[{"given":"Gheorghe","family":"\u015etef\u0102nescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"14_CR1","unstructured":"A. Arnold. Finite transition systems. Prentice-Hall, 1994."},{"key":"14_CR2","unstructured":"Borchert, B. http:\/\/math.uni-heidelberg.de\/logic\/bb\/2dpapers.html"},{"key":"14_CR3","unstructured":"M. Broy, G. Ciobanu, R. Grosu, and G. Stefanescu. Finite interactive systems: A unified model for agents\u2019 behaviour and their interaction. Draft, December, 2001."},{"key":"14_CR4","first-page":"95","volume":"258","author":"M. Broy","year":"2001","unstructured":"M. Broy and G. Stefanescu. The algebra of stream processing functions. Theorertical Computer Science, 258:95\u2013125, 2001.","journal-title":"Theorertical Computer Science"},{"key":"14_CR5","unstructured":"R. Bruni. Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Dipartimento di Informatica, Universita di Pisa, 1999. Report TD-1\/99."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"R. Bruni and U. Montanari. Zero-safe nets, or transition synchronization made simple. Electronic Notes in Theoretical Computer Science, vol. 7(20 pages), 1997.","DOI":"10.1016\/S1571-0661(05)80466-9"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"L. Cardeli and A. Gordon. Anytime, anywhere: modal logics for mobile ambients. In: POPL-2000, Symposium on Principles of Programming Languages, Boston, 2000. ACM Press, 2000.","DOI":"10.1145\/325694.325742"},{"key":"14_CR8","unstructured":"J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"V. Garg","year":"1992","unstructured":"V. Garg and M.T. Ragunath. Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science, 96:285\u2013304, 1992.","journal-title":"Theoretical Computer Science"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"D. Giammarresi and A. Restivo. Two-dimensional languages. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages. Vol. 3: Beyond words, pages 215\u2013265. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59126-6_4"},{"issue":"1","key":"14_CR11","first-page":"112","volume":"6","author":"R. Grosu","year":"2000","unstructured":"R. Grosu, D. Lucanu, and G. Stefanescu. Mixed relations as enriched semiringal categories. Journal of Universal Computer Science, 6(1):112\u2013129, 2000.","journal-title":"Journal of Universal Computer Science"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"R. Grosu, G. Stefanescu, and M. Broy. Visual formalism revised. In Proceeding of the CSD\u201998 (International Conference on Application of Concurrency to System Design, March 23\u201326, 1998, Fukushima, Japan), pages 41\u201351. IEEE Computer Society Press, 1998.","DOI":"10.1109\/CSD.1998.657538"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0255(91)90008-I","volume":"55","author":"K. Inoue","year":"1991","unstructured":"K. Inoue and I. Takanami. A survey of two-dimensional automata theory. Information Sciences, 55:99\u2013121, 1991.","journal-title":"Information Sciences"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"S.C. Kleene. Representation of events in nerve nets and finite automata. In: C.E. Shannon and J. McCarthy, eds.,Automata Studies, Annals of Mathematical Studies, vol. 34, 3\u201341. Princeton University Press, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation110:366\u2013390, 1994.","journal-title":"Information and Computation"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"K. Lindgren, C. Moore, and M. Nordahl. Complexity of two-dimensional patterns. Journal of Statistical Physics 91:909\u2013951, 1998.","journal-title":"Journal of Statistical Physics"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1093\/jigpal\/6.2.349","volume":"6","author":"G. Stefanescu","year":"1998","unstructured":"G. Stefanescu. Reaction and control I. Mixing additive and multiplicative network algebras. Logic Journal of the IGPL, 6(2):349\u2013368, 1998.","journal-title":"Logic Journal of the IGPL"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"G. Stefanescu. Network algebra. Springer-Verlag, 2000.","DOI":"10.1007\/978-1-4471-0479-7"},{"key":"14_CR19","unstructured":"G. Stefanescu. Kleene algebras of two dimensional words: A model for interactive systems. Dagstuhl Seminar on \u201cApplications of Kleene algebras\u201d, Seminar 01081, 19\u201323 February, 2001."},{"key":"14_CR20","unstructured":"G. Stefanescu. Algebra of networks: Modeling simple networks, as well as complex interactive systems. In: H. Schwichtenberg and R. Steibr\u00fcgen, eds., Proof and System Reliability, 49\u201378. Kluwer Academic Publishers, 2002."},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka. Notes on finite asynchronous automata. Theoretical Informatics and Applications, 21:99\u2013135, 1987.","journal-title":"Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36280-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:22:36Z","timestamp":1737372156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36280-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003151","9783540362807"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-36280-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}