{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:01:32Z","timestamp":1748696492607},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540263012"},{"type":"electronic","value":"9783540315599"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494744_24","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T22:31:09Z","timestamp":1279060269000},"page":"423-443","source":"Crossref","is-referenced-by-count":33,"title":["Achieving a General, Formal and Decidable Approach to the OR-Join in Workflow Using Reset Nets"],"prefix":"10.1007","author":[{"given":"Moe Thandar","family":"Wynn","sequence":"first","affiliation":[]},{"given":"David","family":"Edmond","sequence":"additional","affiliation":[]},{"given":"W. M. P.","family":"van der Aalst","sequence":"additional","affiliation":[]},{"given":"A. H. M.","family":"ter Hofstede","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"W.M.P. Aalst van der","year":"1998","unstructured":"van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers\u00a08(1), 21\u201366 (1998)","journal-title":"The Journal of Circuits, Systems and Computers"},{"unstructured":"van der Aalst, W.M.P., Desel, J., Kindler, E.: On the Semantics of EPCs: A Vicious Circle. In: Rump, M., N\u00fcttgens, F.J. (eds.) Proceedings of the EPK 2002: Business Process Management using EPCs, Trier, Germany, pp. 71\u201380. Gesellschaft f\u00fcr Informatik, Bonn (2002)","key":"24_CR2"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.is.2004.02.002","volume":"30","author":"W.M.P. Aalst van der","year":"2005","unstructured":"van der Aalst, W.M.P., ter Hofstede, A.H.M.: YAWL: Yet Another Workflow Language. Information Systems\u00a030(4), 245\u2013275 (2005)","journal-title":"Information Systems"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1022883727209","volume":"14","author":"W.M.P. Aalst van der","year":"2003","unstructured":"van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow Patterns. Distributed and Parallel Databases\u00a014, 5\u201351 (2003)","journal-title":"Distributed and Parallel Databases"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/LICS.1996.561359","volume-title":"Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (27 - 30 July)","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (27 - 30 July), New Brunswick, NJ, pp. 313\u2013321. IEEE Computer Society, Los Alamitos (1996)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-27755-2_11","volume-title":"Lectures on Concurrency and Petri Nets","author":"P. Darondeau","year":"2004","unstructured":"Darondeau, P.: Unbounded Petri net Synthesis. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 413\u2013438. Springer, Heidelberg (2004)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P., Schnoebelen, P.: Boundedness of Reset P\/T Nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 301\u2013310. Springer, Heidelberg (1999)"},{"unstructured":"Eastman Software. RouteBuilder Tool User\u2019s Guide. Eastman Software, Inc., Billerica, MA, USA (1998)","key":"24_CR9"},{"issue":"6","key":"24_CR10","first-page":"1","volume":"68","author":"A. Finkel","year":"2002","unstructured":"Finkel, A., Raskin, J.-F., Samuelides, M., van Begin, L.: Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. Electronic Notes in Theoretical Computer Science\u00a068(6), 1\u201322 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/BFb0054314","volume-title":"LATIN\u201998: Theoretical Informatics","author":"A. Finkel","year":"1998","unstructured":"Finkel, A., Schnoebelen, P.: Fundamental Structures in Well-Structured Infinite Transition Systems. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 102\u2013118. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"24_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured Transition Systems everywhere!. Theoretical Computer Science\u00a0256(1\u20132), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"24_CR13","volume-title":"Workflow Management: Modeling Concepts, Architecture, and Implementation","author":"S. Jablonski","year":"1996","unstructured":"Jablonski, S., Bussler, C.: Workflow Management: Modeling Concepts, Architecture, and Implementation. International Thomson Computer Press, London (1996)"},{"unstructured":"Kiepuszewski, B.: Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. Phd thesis, Queensland University of Technology, Brisbane, Australia (2003)","key":"24_CR14"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-25970-1_6","volume-title":"Business Process Management","author":"E. Kindler","year":"2004","unstructured":"Kindler, E.: On the Semantics of EPCs: A Framework for Resolving the Vicious Circle. In: Desel, J., Pernici, B., Weske, M. (eds.) BPM 2004. LNCS, vol.\u00a03080, pp. 82\u201397. Springer, Heidelberg (2004)"},{"key":"24_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44957-4_7","volume-title":"Computational Logic - CL 2000","author":"M. Leuschel","year":"2000","unstructured":"Leuschel, M., Lehmann, H.: Coverability of Reset Petri Nets and other Well-Structured Transition Systems by Partial Deduction. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 101\u2013115. Springer, Heidelberg (2000)"},{"key":"24_CR17","volume-title":"Production Workflow: Concepts and Techniques","author":"F. Leymann","year":"1999","unstructured":"Leymann, F., Roller, D.: Production Workflow: Concepts and Techniques. Prentice-Hall PTR, Upper Saddle River (1999)"},{"unstructured":"Rittgen, P.: Modified EPCs and their Formal Semantics. Technical Report 99\/19, Institute of Information Systems, University Koblenz-Landau, Koblenz, Germany (1999)","key":"24_CR18"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00122082","volume":"9","author":"A. Yakovlev","year":"1996","unstructured":"Yakovlev, A., Kishinevsky, M., Kondratyev, A., Lavagno, L., Pietkiewicz-Koutny, M.: On the Models for Asynchronous Circuit Behaviour with OR Causality. Formal Methods in System Design\u00a09(3), 189\u2013233 (1996)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494744_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:03:00Z","timestamp":1558281780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494744_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263012","9783540315599"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11494744_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}