{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:02:18Z","timestamp":1725577338388},"publisher-location":"Berlin, Heidelberg","reference-count":79,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190551"},{"type":"electronic","value":"9783642190568"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19056-8_6","type":"book-chapter","created":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T00:55:03Z","timestamp":1296608103000},"page":"92-111","source":"Crossref","is-referenced-by-count":0,"title":["Linear Process Algebra"],"prefix":"10.1007","author":[{"given":"Vaughan","family":"Pratt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","volume":"23","author":"J.F. Allen","year":"1984","unstructured":"Allen, J.F.: Towards a general theory of action and time. Artificial Intelligence\u00a023, 123\u2013154 (1984)","journal-title":"Artificial Intelligence"},{"key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge University Press, Cambridge (1990)"},{"key":"6_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0064579","volume-title":"*-Autonomous categories","author":"M. Barr","year":"1979","unstructured":"Barr, M.: *-Autonomous categories. Lecture Notes in Mathematics, vol.\u00a0752. Springer, Heidelberg (1979)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1017\/S0960129500001274","volume":"1","author":"M. Barr","year":"1991","unstructured":"Barr, M.: *-Autonomous categories and linear logic. Math Structures in Comp. Sci.\u00a01(2), 159\u2013178 (1991)","journal-title":"Math Structures in Comp. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060, 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"6_CR6","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier (North-Holland), Amsterdam (2000)"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.D.: A theory of communicating sequential processes. Journal of the ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"key":"6_CR8","first-page":"208","volume-title":"Logic in Computer Science","author":"C. Brown","year":"1990","unstructured":"Brown, C., Gurr, D.: A categorical linear framework for Petri nets. In: Mitchell, J. (ed.) Logic in Computer Science, pp. 208\u2013218. IEEE Computer Society, Los Alamitos (June 1990)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Brown, C., Gurr, D., de Paiva, V.: A linear specification language for Petri nets. Technical Report DAIMI PB-363, Computer Science Department, Aarhus University (October 1991)","DOI":"10.7146\/dpb.v20i363.6594"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014348","volume-title":"Algebraic Methodology and Software Technology","author":"R. Buckland","year":"1996","unstructured":"Buckland, R., Johnson, M.: Echidna: A system for manipulating explicit choice higher dimensional automata. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol.\u00a01101, Springer, Heidelberg (1996)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0960129500001286","volume":"1","author":"R.T. Casley","year":"1991","unstructured":"Casley, R.T., Crew, R.F., Meseguer, J., Pratt, V.R.: Temporal structures. Math. Structures in Comp. Sci.\u00a01(2), 179\u2013213 (1991)","journal-title":"Math. Structures in Comp. Sci."},{"key":"6_CR12","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, E., Raussen, 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":"6_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0059396","volume-title":"Lokal pr\u00e4sentierbare Kategorien","author":"P. Gabriel","year":"1971","unstructured":"Gabriel, P., Ulmer, F.: Lokal pr\u00e4sentierbare Kategorien. Lecture Notes in Mathematics, vol.\u00a0221. Springer, Heidelberg (1971)"},{"key":"6_CR14","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: Proc. 2nd Annual IEEE Symp. on Logic in Computer Science, Ithaca, NY, pp. 72\u201385 (June 1987)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/321281.321294","volume":"12","author":"S. Ginsburg","year":"1965","unstructured":"Ginsburg, S., Spanier, E.H.: Mappings of languages by two-tape devices. Journal of the ACM\u00a012, 423\u2013434 (1965)","journal-title":"Journal of the ACM"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theoretical Computer Science\u00a061, 199\u2013224 (1988)","journal-title":"Theoretical Computer Science"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R.J. Glabbeek van","year":"1987","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 224\u2013242. Springer, Heidelberg (1987)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","first-page":"254","volume-title":"Proc. of CONCUR 1993","author":"E. Goubault","year":"1993","unstructured":"Goubault, E.: Homology of higher-dimensional automata. In: CONCUR 1993. LNCS, vol.\u00a0630, pp. 254\u2013268. Springer, Heidelberg (1993)"},{"key":"6_CR20","unstructured":"Goubault, E.: The Geometry of Concurrency. PhD thesis, \u00c9cole Normale Sup\u00e9rieure (1995)"},{"key":"6_CR21","volume-title":"Proc. of PEPM 1995","author":"E. Goubault","year":"1995","unstructured":"Goubault, E.: Schedulers as abstract interpretations of hda. In: Proc. of PEPM 1995, La Jolla, ACM Press, New York (June 1995)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-61055-3_36","volume-title":"Programming Languages and Systems - ESOP \u201996","author":"E. Goubault","year":"1996","unstructured":"Goubault, E.: Durations for truly-concurrent actions. In: Riis Nielson, H. (ed.) ESOP 1996. LNCS, vol.\u00a01058, pp. 173\u2013187. Springer, Heidelberg (1996)"},{"key":"6_CR23","volume-title":"Proceedings of the 3rd Theory and Formal Methods Section Workshop","author":"E. Goubault","year":"1996","unstructured":"Goubault, E.: A semantic view on distributed computability and complexity. In: Proceedings of the 3rd Theory and Formal Methods Section Workshop, Imperial College Press, London (1996)"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1017\/S0960129500003121","volume":"10","author":"E. Goubault","year":"2000","unstructured":"Goubault, E.: Geometry and concurrency. Mathematical Structures in Computer Science, Special Issue\u00a010(4), 409\u2013573 (7 papers) (2000)","journal-title":"Mathematical Structures in Computer Science, Special Issue"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-57264-3_30","volume-title":"Static Analysis","author":"E. Goubault","year":"1993","unstructured":"Goubault, E., Cridlig, R.: Semantics and analysis of Linda-based languages. In: Cousot, P., Fil\u00e9, G., Falaschi, M., Rauzy, A. (eds.) WSA 1993. LNCS, vol.\u00a0724, pp. 72\u201386. Springer, Heidelberg (1993)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0084796","volume-title":"CONCUR \u201992","author":"E. Goubault","year":"1992","unstructured":"Goubault, E., Jensen, T.P.: Homology of higher dimensional automata. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 254\u2013268. Springer, Heidelberg (1992)"},{"issue":"2","key":"6_CR27","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"IV","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fundamenta Informaticae\u00a0IV(2), 427\u2013498 (1981)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR28","unstructured":"Greif, I.: Semantics of Communicating Parallel Processes. PhD thesis, Project MAC report TR-154, MIT (1975)"},{"key":"6_CR29","first-page":"184","volume":"54","author":"J. Gunawardena","year":"1994","unstructured":"Gunawardena, J.: Homotopy and concurrency. EATCS Bulletin\u00a054, 184\u2013193 (1994)","journal-title":"EATCS Bulletin"},{"key":"6_CR30","unstructured":"Gupta, V.: Chu Spaces: A Model of Concurrency. PhD thesis, Stanford University, Tech. Report (September 1994), http:\/\/boole.stanford.edu\/pub\/gupthes.pdf"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Gupta, V., Pratt, V.R.: Gates accept concurrent behavior. In: Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci., pp. 62\u201371 (November 1993)","DOI":"10.1109\/SFCS.1993.366881"},{"key":"6_CR32","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Boston (2000)"},{"issue":"8","key":"6_CR33","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Communications of the ACM\u00a021(8), 666\u2013672 (1978)","journal-title":"Communications of the ACM"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(88)90100-4","volume":"59","author":"Y. Lafont","year":"1988","unstructured":"Lafont, Y.: The linear abstract machine. TCS\u00a059, 157\u2013180 (1988)","journal-title":"TCS"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Lafont, Y., Streicher, T.: Games semantics for linear logic. In: Proc. 6th Annual IEEE Symp. on Logic in Computer Science, Amsterdam, pp. 43\u201349 (July 1991)","DOI":"10.1109\/LICS.1991.151629"},{"key":"6_CR36","volume-title":"Introduction to Higher-Order Categorical Logic","author":"J. Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.: Introduction to Higher-Order Categorical Logic. Cambridge University Press, Cambridge (1986)"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Technical Report DAIMI Report PB-78, Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures, and domains, part I. Theoretical Computer Science\u00a013, 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"6_CR40","volume-title":"The Theory of Database Concurrency Control","author":"C. Papadimitriou","year":"1986","unstructured":"Papadimitriou, C.: The Theory of Database Concurrency Control. Computer Science Press, Rockville (1986)"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proc. Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"6_CR42","first-page":"386","volume-title":"Proc. IFIP Congress 62","author":"C.A. Petri","year":"1962","unstructured":"Petri, C.A.: Fundamentals of a theory of asynchronous information flow. In: Proc. IFIP Congress 62, Munich, pp. 386\u2013390. North-Holland, Amsterdam (1962)"},{"key":"6_CR43","first-page":"363","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"G.D. Plotkin","year":"1980","unstructured":"Plotkin, G.D.: Lambda definability in the full type hierarchy. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 363\u2013373. Academic Press, London (1980)"},{"key":"#cr-split#-6_CR44.1","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Technical Report Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark (1981);"},{"key":"#cr-split#-6_CR44.2","doi-asserted-by":"crossref","unstructured":"Reprinted with corrections in J. Log. Algebr. Program. (60-61), 17???139 (2004)","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th IEEE Symposium on Foundations of Computer Science, pp. 46\u201357 (October 1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. In: Proc. 17th Ann. IEEE Symp. on Foundations of Comp. Sci., pp. 109\u2013121 (October 1976)","DOI":"10.1109\/SFCS.1976.27"},{"key":"6_CR47","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Process logic. In: Proc. 6th Ann. ACM Symposium on Principles of Programming Languages, San Antonio, pp. 93\u2013100 (January 1979)","DOI":"10.1145\/567752.567761"},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: On the composition of processes. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages (January 1982)","DOI":"10.1145\/582153.582177"},{"key":"6_CR49","unstructured":"Pratt, V.R.: Position statement. Circulated at the Panel on Mathematics of Parallel Processes, chair A.R.G. Milner, IFIP-83 (September 1983)"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","first-page":"180","volume-title":"Proc. CMU\/SERC Workshop on Analysis of Concurrency","author":"V.R. Pratt","year":"1984","unstructured":"Pratt, V.R.: The pomset model of parallel processes: Unifying the temporal and the spatial. In: Seminar on Concurrency. LNCS, vol.\u00a0197, pp. 180\u2013196. Springer, Heidelberg (1984)"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-15648-8_22","volume-title":"Proc. Conf. on Logics of Programs","author":"V.R. Pratt","year":"1985","unstructured":"Pratt, V.R.: Some constructions for order-theoretic models of concurrency. In: Logics of Programs. LNCS, vol.\u00a0193, pp. 269\u2013283. Springer, Heidelberg (1985)"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-16047-7_39","volume-title":"The Analysis of Concurrent Systems: Proceedings of a Tutorial and Workshop","author":"V.R. Pratt","year":"1985","unstructured":"Pratt, V.R.: Two-way channel with disconnect. In: The Analysis of Concurrent Systems: Proceedings of a Tutorial and Workshop. LNCS, vol.\u00a0207, pp. 110\u2013111. Springer, Heidelberg (1985)"},{"issue":"1","key":"6_CR53","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"Pratt, V.R.: Modeling concurrency with partial orders. Int. J. of Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"Int. J. of Parallel Programming"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Modeling concurrency with geometry. In: Proc. 18th Ann. ACM Symposium on Principles of Programming Languages, pp. 311\u2013322 (January 1991)","DOI":"10.1145\/99583.99625"},{"key":"6_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/BFb0023846","volume-title":"LATIN \u201992","author":"V.R. Pratt","year":"1992","unstructured":"Pratt, V.R.: Arithmetic + logic + geometry=concurrency. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 430\u2013447. Springer, Heidelberg (1992)"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BFb0084795","volume-title":"CONCUR \u201992","author":"V.R. Pratt","year":"1992","unstructured":"Pratt, V.R.: The duality of time and information. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 237\u2013253. Springer, Heidelberg (1992)"},{"key":"6_CR57","first-page":"1","volume-title":"Algebraic Methodology and Software Technology, AMAST 1991","author":"V.R. Pratt","year":"1992","unstructured":"Pratt, V.R.: Event spaces and their linear logic. In: Algebraic Methodology and Software Technology, Workshops in Computing, AMAST 1991, Iowa City, pp. 1\u201323. Springer, Heidelberg (1992)"},{"key":"6_CR58","unstructured":"Pratt, V.R.: Chu spaces: complementarity and uncertainty in rational mechanics. Technical report, TEMPUS Summer School, Budapest (July 1994) (manuscript), http:\/\/boole.stanford.edu\/pub\/bud.pdf"},{"key":"6_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0026562","volume-title":"Theory and Practice of Parallel Programming","author":"V.R. Pratt","year":"1995","unstructured":"Pratt, V.R.: Time and information in sequential and concurrent computation. In: Ito, T. (ed.) TPPP 1994. LNCS, vol.\u00a0907, pp. 1\u201324. Springer, Heidelberg (1995)"},{"key":"6_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/BFb0015256","volume-title":"Computer Science Today","author":"V.R. Pratt","year":"1995","unstructured":"Pratt, V.R.: Chu spaces and their interpretation as concurrent objects. In: van Leeuwen, J. (ed.) Computer Science Today: Recent Trends and Developments. LNCS, vol.\u00a01000, pp. 392\u2013405. Springer, Heidelberg (1995)"},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Types as processes, via Chu spaces, Santa Margherita. In: Electronic Notes in Theoretical Computer Science, Santa Margherita, vol.\u00a07, p. 21 (1997), http:\/\/www.elsevier.nl\/locate\/entcs\/volume7.html","DOI":"10.1016\/S1571-0661(05)80475-X"},{"key":"6_CR62","unstructured":"Pratt, V.R.: Chu spaces: Notes for school on category theory and applications. Technical report, University of Coimbra, Coimbra, Portugal (July 1999) (manuscript) http:\/\/boole.stanford.edu\/pub\/coimbra.pdf"},{"key":"6_CR63","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1017\/S0960129500003169","volume":"10","author":"V.R. Pratt","year":"2000","unstructured":"Pratt, V.R.: Higher dimensional automata revisited. Math. Structures in Comp. Sci.\u00a010, 525\u2013548 (2000)","journal-title":"Math. Structures in Comp. Sci."},{"key":"6_CR64","unstructured":"Pratt, V.R.: Orthocurrence as both interaction and observation. In: Rodriguez, R., Anger, F. (eds.) Proc. Workshop on Spatial and Temporal Reasoning, IJCAI 2001, Seattle (August 2001)"},{"key":"6_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-45694-5_3","volume-title":"CONCUR 2002 - Concurrency Theory","author":"V.R. Pratt","year":"2002","unstructured":"Pratt, V.R.: Event-state duality: The enriched case. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, p. 41. Springer, Heidelberg (2002)"},{"issue":"3","key":"6_CR66","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0304-3975(01)00169-4","volume":"294","author":"V.R. Pratt","year":"2003","unstructured":"Pratt, V.R.: Chu spaces as a semantic bridge between linear logic and mathematics. Theoretical Computer Science\u00a0294(3), 439\u2013471 (2003); Selected papers from Linear Logic 1996, Tokyo","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"6_CR67","first-page":"485","volume":"13","author":"V.R. Pratt","year":"2003","unstructured":"Pratt, V.R.: Transition and cancellation in concurrency and branching time. Math. Structures in Comp. Sci., Special Issue on the Difference Between Sequentiality and Concurrency\u00a013(4), 485\u2013529 (2003)","journal-title":"Math. Structures in Comp. Sci., Special Issue on the Difference Between Sequentiality and Concurrency"},{"key":"6_CR68","unstructured":"Riddle, W.: The Modeling and Analysis of Supervisory Systems. PhD thesis, Computer Science Dept., Stanford University, p. 174 (March 1972)"},{"key":"6_CR69","unstructured":"Rodriguez, R.V., Anger, F.D.: Branching time via Chu spaces. In: Rodriguez, R., Anger, F. (eds.) Proc. Workshop on Spatial and Temporal Reasoning, IJCAI 2001, Seattle (August 2001)"},{"key":"6_CR70","unstructured":"Sassone, V., Cattani, G.L.: Higher-dimensional transition systems. In: Proceedings of LICS 1996 (1996)"},{"key":"6_CR71","doi-asserted-by":"crossref","unstructured":"Shields, M.: Deterministic asynchronous automata. In: Neuhold, E.J., Chroust, G. (eds.) Formal Models in Programming. Elsevier Science Publishers, B.V., North Holland (1985)","DOI":"10.1007\/3-540-15641-0_26"},{"key":"6_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-61064-2_30","volume-title":"Trees in Algebra and Programming - CAAP \u201996","author":"Y. Takayama","year":"1996","unstructured":"Takayama, Y.: Extraction of concurrent processes from higher-dimensional automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 72\u201385. Springer, Heidelberg (1996)"},{"key":"6_CR73","unstructured":"van Glabbeek, R.: Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Vrije Universiteit te Amsterdam (May 1990)"},{"key":"6_CR74","unstructured":"van Glabbeek, R.: Bisimulations for higher dimensional automata (June 1991) (manuscript), http:\/\/theory.stanford.edu\/~rvg\/hda"},{"issue":"3","key":"6_CR75","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.tcs.2006.02.012","volume":"356","author":"R. Glabbeek van","year":"2006","unstructured":"van Glabbeek, R.: On the expressiveness of higher dimensional automata. Theoretical Computer Science\u00a0356(3), 169\u2013194 (2006)","journal-title":"Theoretical Computer Science"},{"key":"6_CR76","unstructured":"Winskel, G.: Events in Computation. PhD thesis, Dept. of Computer Science, University of Edinburgh (1980)"},{"key":"6_CR77","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255. Springer, Heidelberg (1987)"},{"key":"6_CR78","series-title":"Lecture Notes in Computer Science","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol.\u00a0354. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19056-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T10:49:47Z","timestamp":1637232587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19056-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190551","9783642190568"],"references-count":79,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19056-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}