{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:34Z","timestamp":1725487054568},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425229"},{"type":"electronic","value":"9783540447436"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44743-1_12","type":"book-chapter","created":{"date-parts":[[2007,6,29]],"date-time":"2007-06-29T06:23:38Z","timestamp":1183098218000},"page":"128-141","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Timed Net Processes Categorically"],"prefix":"10.1007","author":[{"given":"I. B.","family":"Virbitskaite","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s002360050047","volume":"33","author":"L. Aceto","year":"1996","unstructured":"L. Aceto, D. Murphi. Timing and causality in process algebra. Acta Informatica 33(4) (1996) 317\u2013350.","journal-title":"Acta Informatica"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur, D. Dill. The theory of timed automata. Theoretical Computer Science 126 (1994) 183\u2013235.","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-63139-9_34","volume-title":"Application and Theory of Petri Nets 1997","author":"T. Aura","year":"1997","unstructured":"T. Aura, J. Lilius. Time processes for time Petri nets. Lecture Notes in Computer Science 1248 (1997) 136\u2013155."},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","first-page":"211","volume-title":"CONCUR\u201999 - Concurrency Theory: 10th International Conference","author":"B. Bieber","year":"1999","unstructured":"B. Bieber, H. Fleischhack. Model checking of time Petri nets based on partial order semantics. Lecture Notes in Computer Science 1662 (1999) 211\u2013225."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/3-540-55719-9_105","volume-title":"Automata, Languages and Programming","author":"C. Brown","year":"1992","unstructured":"C. Brown, D. Gurr. Timing Petri nets categorically. Lecture Notes in Computer Science 623 (1992) 571\u2013582."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0960129500001286","volume":"1","author":"R.T. Casley","year":"1991","unstructured":"R.T. Casley, R.F. Crew, J. Meseguer, V.R. Pratt. Temporal structures. Mathematical Structures in Computer Science 1(2) (1991) 179\u2013213.","journal-title":"Mathematical Structures in Computer Science"},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume-title":"Computer Aided Verification","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"K. \u010cer\u0101ns. Decidability of bisimulation equivalences for parallel timer processes. Lecture Notes in Computer Science 663 (1993) 302\u2013315."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet. Branching processes of Petri nets. Acta Informatica 28 (1991) 576\u2013591.","journal-title":"Acta Informatica"},{"key":"12_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. Roemer, W. Vogler An improvement of McMillan\u2019s unfolding algorithm. Lecture Notes in Computer Science 1055 (1996) (87\u2013106)."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy, R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM 32 (1985) 137\u2013162.","journal-title":"Journal of ACM"},{"issue":"1\u20132","key":"12_CR11","first-page":"61","volume":"38","author":"T. Hune","year":"1999","unstructured":"T. Hune, M. Nielsen. Bisimulation and open maps for timed transition systems. Fundamenta Informaticae 38(1\u20132) (1999) 61\u201377.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"A. Joyal, M. Nielsen, G. Winskel. Bisimulation from open maps. Information and Computation 127(2) (1996) 164\u2013185.","journal-title":"Information and Computation"},{"key":"12_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-61648-9_52","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J.-P. Katoen","year":"1996","unstructured":"J.-P. Katoen, R. Langerak, D. Latella, E. Brinksma. On specifying real-time sys-tems in a causality-based setting. Lecture Notes in Computer Science 1135 (1996) 385\u2013404."},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-60246-1_158","volume-title":"Mathematical Foundations of Computer Science","author":"F. Laroussinie","year":"1995","unstructured":"F. Laroussinie, K.G. Larsen, C. Weise. From timed automata to logic and back. Lecture Notes in Computer Science 969 (1995) 529\u2013539."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"J. Lilius. Efficient state space search for time Petri nets. Proc. MFCS\u201998 Workshop on Concurrency, August 1998, Brno (Czech Republic), FIMU Report Series, FIMU RS-98-06 (1998) 123\u2013130.","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"P. Merlin, D.J. Faber. Recoverability of communication protocols. IEEE Trans. of Communication COM-24(9) (1976).","DOI":"10.1109\/TCOM.1976.1093424"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"J. Meseguer, U. Montanari. Petri nets are monoids. Information and Computation 88 (1990) 105\u2013154.","journal-title":"Information and Computation"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(95)00121-2","volume":"153","author":"J. Meseguer","year":"1996","unstructured":"J. Meseguer, U. Montanari, V. Sassone. Process versus unfolding semantics for Place\/Transition Petri nets. Theoretical Computer Science 153 (1996) 171\u2013210.","journal-title":"Theoretical Computer Science"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"K. McMillan. Symbolic model checking-an aproach to the state explosion problem. PhD Thesis, SCS, Carnegie Mellon University (1992).","DOI":"10.1007\/978-1-4615-3190-6_3"},{"key":"12_CR20","doi-asserted-by":"crossref","first-page":"403","DOI":"10.3233\/FI-1993-193-410","volume":"19","author":"D. Murphy","year":"1993","unstructured":"D. Murphy. Time and duration in noninterleaving concurrency. Fundamenta Informaticae 19 (1993) 403\u2013416.","journal-title":"Fundamenta Informaticae"},{"key":"12_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/BFb0032006","volume-title":"Real-Time: Theory in Practice","author":"X. Nicolin","year":"1992","unstructured":"X. Nicolin, J. Sifakis. An overview and synthesis on timed process algebras. Lecture Notes in Computer Science 600 (1992) 526\u2013548."},{"key":"12_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61055-3","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Nielsen","year":"1996","unstructured":"M. Nielsen, A. Cheng. Observing behaviour categorically. Lecture Notes in Computer Science 1026 (1996) 263\u2013278."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"M. Nielsen, G. Winskel. Petri nets and bisimulation. Theoretical Computer Science 153 (1996).","DOI":"10.1016\/0304-3975(95)00122-0"},{"key":"12_CR24","volume-title":"PhD Thesis","author":"C. Ramchandani","year":"1974","unstructured":"C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. Cambridge, Mass.: MIT, Dept. Electronical Engineering, PhD Thesis, 1974."},{"key":"12_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-59293-8_205","volume-title":"TAPSOFT\u201995: Theory and Practice of Software Development","author":"V. Sassone","year":"1995","unstructured":"V. Sassone. On the category of Petri Net Computations. Lecture Notes in Computer Science 915 (1995) 334\u2013348."},{"key":"12_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/3-540-60029-9_56","volume-title":"Application and Theory of Petri Nets 1995","author":"V. Valero","year":"1995","unstructured":"V. Valero, D. de Frutos, F. Cuartero. Timed Processes of Timed Petri Nets. Lecture Notes in Computer Science 935 (1995) 490\u2013509."},{"key":"12_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023458","volume-title":"STACS 97","author":"C. Weise","year":"1997","unstructured":"C. Weise, D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Lecture Notes in Computer Science 1200 (1997) 176\u2013188."},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0890-5401(87)90032-0","volume":"72","author":"G. Winskel","year":"1987","unstructured":"G. Winskel. Petri nets, algebras, morphisms, compositionality. Information and Computation 72 (1987) 197\u2013238.","journal-title":"Information and Computation"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"G. Winskel, M. Nielsen. Models for concurrency. In Handbook of Logic in Computer Science 4 (1995).","DOI":"10.1093\/oso\/9780198537809.003.0001"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44743-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T15:14:36Z","timestamp":1708010076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44743-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425229","9783540447436"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-44743-1_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}