{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:46:59Z","timestamp":1725670019845},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642288685"},{"type":"electronic","value":"9783642288692"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28869-2_14","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T16:44:36Z","timestamp":1332434676000},"page":"274-294","source":"Crossref","is-referenced-by-count":15,"title":["Trace Spaces: An Efficient New Technique for State-Space Reduction"],"prefix":"10.1007","author":[{"given":"Lisbeth","family":"Fajstrup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Goubault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Haucourt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Mimram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Raussen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"The SPIN Model-Checker, http:\/\/spinroot.com\/"},{"key":"14_CR2","unstructured":"Berge, C.: Hypergraphs, vol.\u00a0445. North Holland Mathematical Library (1989)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-24270-0_7","volume-title":"Computer Safety, Reliability, and Security","author":"R. Bonichon","year":"2011","unstructured":"Bonichon, R., Canet, G., Correnson, L., Goubault, E., Haucourt, E., Hirschowitz, M., Labb\u00e9, S., Mimram, S.: Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software. In: Flammini, F., Bologna, S., Vittorini, V. (eds.) SAFECOMP 2011. LNCS, vol.\u00a06894, pp. 85\u201398. Springer, Heidelberg (2011)"},{"key":"14_CR4","unstructured":"Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press (1999)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of Principles Of Programming Languages, pp. 269\u2013282. ACM Press (1979)","DOI":"10.1145\/567752.567778"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation based program testing. In: Proc. of the SSGRR 2000 Computer & eBusiness International Conference (2000)","DOI":"10.1145\/325694.325699"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.: The Structure of the THE Operating System. Com. of the ACM\u00a011(15) (1968)","DOI":"10.1145\/363095.363143"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica\u00a01(2) (1971)","DOI":"10.1007\/BF00289519"},{"key":"14_CR10","unstructured":"Fajstrup, L.: Trace spaces of directed tori with rectangular holes. Technical Report R-2011-08, Aalborg Univ. (2001)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0055632","volume-title":"CONCUR \u201998 Concurrency Theory","author":"L. Fajstrup","year":"1998","unstructured":"Fajstrup, L., Goubault, \u00c9., Rau\u00dfen, M.: Detecting Deadlocks in Concurrent Systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 332\u2013347. Springer, Heidelberg (1998)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Fajstrup, L., Sokolowski, S.: Infinitely running concurrent processes with loops from a geometric viewpoint. ENTCS\u00a039(2) (2000)","DOI":"10.1016\/S1571-0661(05)01147-3"},{"issue":"1-3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.tcs.2006.03.022","volume":"357","author":"L. Fajstrup","year":"2006","unstructured":"Fajstrup, L., Rau\u00dfen, M., Goubault, E.: Algebraic topology and concurrency. Theor. Comput. Sci.\u00a0357(1-3), 241\u2013278 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/B:APCS.0000013812.75342.de","volume":"12","author":"L. Fajstrup","year":"2004","unstructured":"Fajstrup, L., Rau\u00dfen, M., Goubault, E., Haucourt, E.: Components of the fundamental category. Appl. Cat. Struct.\u00a012(1), 81\u2013108 (2004)","journal-title":"Appl. Cat. Struct."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-55179-4_32","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"Godefroid, P., Wolper, P.: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 332\u2013342. Springer, Heidelberg (1992)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11539452_38","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"\u00c9. Goubault","year":"2005","unstructured":"Goubault, \u00c9., Haucourt, E.: A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 503\u2013517. Springer, Heidelberg (2005)"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10485-007-9082-7","volume":"15","author":"E. Goubault","year":"2007","unstructured":"Goubault, E., Haucourt, E.: Components of the fundamental category II. Applied Categorical Structures\u00a015(4), 387\u2013414 (2007)","journal-title":"Applied Categorical Structures"},{"key":"14_CR18","unstructured":"Goubault, E., Mimram, S.: Formal relationships between geometrical and classical models for concurrency. CoRR, abs\/1004.2818 (2010)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Grandis, M.: Directed Algebraic Topology, Models of Non-Reversible Worlds. New Mathematical Monographs, vol.\u00a013. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511657474"},{"key":"14_CR20","first-page":"184","volume":"54","author":"J. Gunawardena","year":"1994","unstructured":"Gunawardena, J.: Homotopy and concurrency. Bulletin of the EATCS\u00a054, 184\u2013193 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-48318-7_8","volume-title":"Algorithm Engineering","author":"D.J. Kavvadias","year":"1999","unstructured":"Kavvadias, D.J., Stavropoulos, E.C.: Evaluation of an Algorithm for the Transversal Hypergraph Problem. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 72\u201384. Springer, Heidelberg (1999)"},{"key":"14_CR22","volume-title":"Combinatorial Algebraic Topology","author":"D. Kozlov","year":"2007","unstructured":"Kozlov, D.: Combinatorial Algebraic Topology. Springer, Heidelberg (2007)"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.dam.2008.05.032","volume":"157","author":"S. Peltier","year":"2009","unstructured":"Peltier, S., Fuchs, L., Lienhardt, P.: Simploidals sets: Definitions, Operations and Comparison with Simplicial Sets. Discrete Applied Math.\u00a0157, 542\u2013557 (2009)","journal-title":"Discrete Applied Math."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.2140\/agt.2010.10.1683","volume":"10","author":"M. Raussen","year":"2010","unstructured":"Raussen, M.: Simplicial models of trace spaces. Alg. & Geom. Top.\u00a010, 1683\u20131714 (2010)","journal-title":"Alg. & Geom. Top."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0023729","volume-title":"Computer-Aided Verification","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 156\u2013165. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28869-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:13:38Z","timestamp":1620112418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28869-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288685","9783642288692"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28869-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}