{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:29Z","timestamp":1725878069244},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319522333"},{"type":"electronic","value":"9783319522340"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52234-0_9","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T23:52:06Z","timestamp":1484092326000},"page":"151-168","source":"Crossref","is-referenced-by-count":2,"title":["Independence Abstractions and Models of Concurrency"],"prefix":"10.1007","author":[{"given":"Vijay","family":"D\u2019Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kroening","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo","family":"Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"issue":"2\u20133","key":"9_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.tcs.2004.07.036","volume":"335","author":"JCM Baeten","year":"2005","unstructured":"Baeten, J.C.M.: A brief history of process algebra. Theor. Comput. Sci. 335(2\u20133), 131\u2013146 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"9_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"JA Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control 60(1\u20133), 109\u2013137 (1984)","journal-title":"Inf. Control"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Boudol, G.: Flow event structures and flow nets. In: Proceedings of Semantics of Systems of Concurrent Processes, LITP Spring School on Theoretical Computer Science, La Roche Posay, France, 23\u201327 April 1990, pp. 62\u201395 (1990)","DOI":"10.1007\/3-540-53479-2_4"},{"issue":"1\u20132","key":"9_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(00)00313-3","volume":"277","author":"P Cousot","year":"2002","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theor. Comput. Sci. 277(1\u20132), 47\u2013103 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V Diekert","year":"1995","unstructured":"Diekert, V.: The Book of Traces. World Scientific Publishing Co., Inc., River Edge (1995)"},{"key":"9_CR6","series-title":"EATCS Monographs in Theoretical Computer Science","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: Principles of Programming Languages (POPL), pp. 110\u2013121. ACM (2005)","DOI":"10.1145\/1040305.1040315"},{"key":"9_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04293-9","volume-title":"Introduction to Process Algebra","author":"W Fokkink","year":"2000","unstructured":"Fokkink, W.: Introduction to Process Algebra. Springer, Heidelberg (2000)"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.: The linear time - branching time spectrum I: the semantics of concrete, sequential processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"issue":"41","key":"9_CR10","doi-asserted-by":"crossref","first-page":"4111","DOI":"10.1016\/j.tcs.2009.06.014","volume":"410","author":"RJ Glabbeek van","year":"2009","unstructured":"van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and petri nets. Theor. Comput. Sci. 410(41), 4111\u20134159 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem","year":"1996","unstructured":"Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Berlin (1996). doi: 10.1007\/3-540-60761-7"},{"issue":"2","key":"9_CR12","first-page":"187","volume":"7","author":"D Kuske","year":"2001","unstructured":"Kuske, D., Morin, R.: Pomsets for local trace languages. J. Automata Lang. Comb. 7(2), 187\u2013224 (2001)","journal-title":"J. Automata Lang. Comb."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-17906-2_30","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"A Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278\u2013324. Springer, Berlin, Heidelberg (1987). doi: 10.1007\/3-540-17906-2_30"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Computer Aided Verification","author":"K,L McMillan","year":"1993","unstructured":"McMillan, K,L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Bochmann, Gregor, Probst, David, Karl (eds.) CAV 1992. LNCS, vol. 663, pp. 164\u2013177. Springer, Berlin, Heidelberg (1993). doi: 10.1007\/3-540-56496-9_14"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-45541-8_7","volume-title":"Unifying Petri Nets: Advances in Petri Nets","author":"J Padberg","year":"2001","unstructured":"Padberg, J., Ehrig, H.: Parameterized net classes: a uniform approach to petri net classes. In: Ehrig, H., Padberg, J., Juh\u00e1s, G., Rozenberg, G. (eds.) Unifying Petri Nets. LNCS, vol. 2128, pp. 173\u2013229. Springer, Berlin, Heidelberg (2001). doi: 10.1007\/3-540-45541-8_7"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-61550-4_141","volume-title":"Mathematical Foundations of Computer Science 1996","author":"D Peled","year":"1996","unstructured":"Peled, D.: Partial order reduction: model-checking using representatives. In: Penczek, W., Sza\u0142as, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 93\u2013112. Springer, Berlin, Heidelberg (1996). doi: 10.1007\/3-540-61550-4_141"},{"key":"9_CR17","unstructured":"Petri, C.A.: Fundamentals of a theory of asynchronous information flow. In: IFIP Congress, pp. 386\u2013390 (1962)"},{"issue":"2","key":"9_CR18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0304-3975(94)00174-H","volume":"138","author":"GM Pinna","year":"1995","unstructured":"Pinna, G.M., Poign\u00e9, A.: On the nature of events: another perspective in concurrency. Theor. Comput. Sci. 138(2), 425\u2013454 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. Int. J. Parallel Program. 15(1), 33\u201371 (1986)","journal-title":"Int. J. Parallel Program."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Event-state duality: the enriched case. In: Proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, Brno, Czech Republic, 20\u201323 August 2002, pp. 41\u201356 (2002)","DOI":"10.1007\/3-540-45694-5_3"},{"key":"9_CR21","unstructured":"Rodr\u00edguez, C., Sousa, M., Sharma, S., Kroening, D.: Unfolding-based partial order reduction. In: Concurrency Theory (CONCUR). Leibniz International Proceedings in Informatics, vol. 42, pp. 456\u2013469. Dagstuhl Publishing (2015)"},{"issue":"1\u20132","key":"9_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(96)80710-9","volume":"170","author":"V Sassone","year":"1996","unstructured":"Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. Theor. Comput. Sci. 170(1\u20132), 297\u2013348 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Winskel, G.: An introduction to event structures. In: School\/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pp. 364\u2013397 (1988)","DOI":"10.1007\/BFb0013026"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52234-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T07:09:36Z","timestamp":1568704176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52234-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319522333","9783319522340"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52234-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}