{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:34:39Z","timestamp":1726407279947},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_27","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"387-401","source":"Crossref","is-referenced-by-count":3,"title":["Note on the Tableau Technique for Commutative Transition Systems"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"P.A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91\u2013101, 1996.","journal-title":"Information and Computation"},{"issue":"2","key":"27_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1986-9202","volume":"IX","author":"J.C.M. Baeten","year":"1986","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae, IX(2):127\u2013168, 1986.","journal-title":"Fundamenta Informaticae"},{"key":"27_CR3","unstructured":"J.C.M. Baeten and J.A. Bergstra. Mode transfer in process algebra. Technical report CSR 00-01, Vakgroep Informatica, Technische Universiteit Eindhoven, 2000."},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/3-540-46432-8_3","volume-title":"Proc. of FOSSACS\u20192000","author":"B. Berard","year":"2000","unstructured":"B. Berard, A. Labroue, and Ph. Schnoebelen. Verifying performance equivalence for timed basic parallel processes. In Proc. of FOSSACS\u20192000, volume 1784 of LNCS, p. 35\u201347. Springer-Verlag, 2000."},{"key":"27_CR5","unstructured":"J.A. Bergstra. A mode transfer operator in process algebra. Technical report P8808b, University of Amsterdam, The Netherlands, 1989."},{"key":"27_CR6","unstructured":"T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In Proc. of the IFIP WG 6.11 0th International Symposium on Protocol Specification, Testing and Verification, p. 1\u201314. Amsterdam, 1990."},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"Proc. of STACS\u201999","author":"A. Bouajjani","year":"1999","unstructured":"A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. of STACS\u201999, volume 1563 of LNCS, p. 323\u2013333. Springer-Verlag, 1999."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, chapter 9, p. 545\u2013623. Elsevier Science, 2001.","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"27_CR9","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993."},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"Proc. of CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for basic parallel processes. In Proc. of CONCUR\u201993, volume 715 of LNCS, p. 143\u2013157. Springer-Verlag, 1993."},{"key":"27_CR11","unstructured":"T. Cobben and A. Engels. Disrupt and interrupt in MSC: Possibilities and problems. In Proc. of the 1st Workshop of the SDL Forum Society on SDL and MSC, number 104 in Informatik-Berichte, p. 75\u201383. 1998."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"L.E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics, 35:413\u2013422, 1913.","journal-title":"American Journal of Mathematics"},{"key":"27_CR13","unstructured":"B. Diertens. New features in PSF I: Interrupts, disrupts, and priorities. Technical report P9417, University of Amsterdam, The Netherlands, 1994."},{"key":"27_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-56863-8_52","volume-title":"Application and Theory of Petri Nets","author":"H.M. Hanisch","year":"1993","unstructured":"H.M. Hanisch. Analysis of place\/transition nets with timed-arcs and its application to batch process control. In Application and Theory of Petri Nets, volume 691 of LNCS, p. 282\u2013299, 1993."},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jancar","year":"1995","unstructured":"P. Jancar. Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148(2):281\u2013301, 1995.","journal-title":"Theoretical Computer Science"},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-48320-9_5","volume-title":"Proc. of CONCUR\u2019 99","author":"P. Jancar","year":"1999","unstructured":"P. Jancar and F. Moller. Techniques for decidability and undecidability of bisimilarity-an invited tutorial. In Proc. of CONCUR\u2019 99, volume 1664 of LNCS, p. 30\u201345. Springer-Verlag, 1999."},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"R. Mayr. Process rewrite systems. Information and Comp., 156(1):264\u2013286, 2000.","journal-title":"Information and Comp."},{"key":"27_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of LATIN\u201900","author":"R. Mayr","year":"2000","unstructured":"R. Mayr. Undecidable problems in unreliable computations. In Proc. of LATIN\u201900, volume 1776 of LNCS. Springer-Verlag, 2000."},{"key":"27_CR19","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"27_CR20","series-title":"Lect Notes Comput Sci","first-page":"187","volume-title":"ICATPN 2000","author":"V. V. Ruiz","year":"2000","unstructured":"V. Valero Ruiz, D. de Frutos Escrig, and O. Marroquin Alonso. Decidability of properties of timed-arc Petri nets. In ICATPN 2000, volume 1825 of LNCS, p. 187\u2013206. Springer-Verlag, 2000."},{"issue":"1\u20132","key":"27_CR21","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/S0304-3975(00)00290-5","volume":"266","author":"J. Srba","year":"2001","unstructured":"J. Srba. Basic process algebra with deadlocking states. Theoretical Computer Science, 266(1\u20132):605\u2013630, 2001.","journal-title":"Theoretical Computer Science"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"J. Srba. Note on the tableau technique for commutative transition systems. Technical Report RS-01-50, BRICS Research Series, 2001.","DOI":"10.7146\/brics.v8i50.21711"},{"key":"27_CR23","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of STACS\u201902","author":"J. Srba","year":"2002","unstructured":"J. Srba. Strong bisimilarity and regularity of basic parallel processes is PSPACEhard. In Proc. of STACS\u201902, LNCS. Springer-Verlag, 2002. To appear."},{"key":"27_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-45315-6_25","volume-title":"Proc. of FOSSACS\u201901","author":"C. Stirling","year":"2001","unstructured":"C. Stirling. Decidability of weak bisimilarity for a subset of basic parallel processes. In Proc. of FOSSACS\u201901, volume 2030 of LNCS, p. 379\u2013393. Springer-Verlag, 2001."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T21:40:17Z","timestamp":1628977217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}