{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:05:04Z","timestamp":1726412704944},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629207"},{"type":"electronic","value":"9783540690467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0027420","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:34:36Z","timestamp":1132641276000},"page":"276-290","source":"Crossref","is-referenced-by-count":5,"title":["Tableau methods for PA-processes"],"prefix":"10.1007","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"J. Bradfield, J. Esparza, and A. Mader. An effective tableau system for the linear time \u03bc-calculus. In F. Meyer auf der Heide and B. Monien, editors, Proceedings of ICALP'96, number 1099 in LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61440-0_120"},{"key":"20_CR2","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Javier Esparza. Petri nets, commutative context-free grammars and basic parallel processes. In Horst Reichel, editor, Fundamentals of Computation Theory, number 965 in LNCS. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60249-6"},{"key":"20_CR4","unstructured":"J. Esparza. More infinite results. In B. Steffen and T. Margaria, editors, Proceedings of INFINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"E. Mayr. An algorithm for the general petri net reachability problem. SIAM Journal of Computing, 13:441\u2013460, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"20_CR6","unstructured":"Richard Mayr. Model checking pa-processes. Technical Report TUM-I9640, TU-M\u00fcnchen, December 1996."},{"key":"20_CR7","unstructured":"Richard Mayr. Semantic reachability for simple process algebras. In B. Steffen and T. Margaria, editors, Proceedings of INFINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996."},{"key":"20_CR8","unstructured":"Richard Mayr. A tableau system for model checking petri nets with a fragment of the linear time \u03bc-calculus. Technical Report TUM-I9634, TU-M\u00fcnchen, October 1996."},{"key":"20_CR9","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T21:32:59Z","timestamp":1554586379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629207","9783540690467"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0027420","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}