{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:04:23Z","timestamp":1762459463408,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_3","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T10:39:21Z","timestamp":1487155161000},"page":"51-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus"],"prefix":"10.1007","author":[{"given":"Thomas Troels","family":"Hildebrandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Johansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e5kon","family":"Normann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"3_CR1","unstructured":"Bednarczyk, M.A.: Categories of asynchronous systems. Ph.D. thesis, University of Sussex (1988)"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-7(1:11)2011","volume":"7","author":"J Bengtson","year":"2011","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Log. Methods Comput. Sci. 7(1), 1\u201344 (2011). http:\/\/dx.doi.org\/10.2168\/LMCS-7(1:11)2011","journal-title":"Log. Methods Comput. Sci."},{"issue":"28","key":"3_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"3","author":"E Best","year":"1991","unstructured":"Best, E., Devillers, R., Kiehn, A., Pomello, L.: Concurrent bisimulations in petri nets. Acta Inform. 3(28), 231\u2013264 (1991)","journal-title":"Acta Inform."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-59042-0_77","volume-title":"STACS 95","author":"M Boreale","year":"1995","unstructured":"Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the $$\\pi $$ -calculus. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 243\u2013254. Springer, Heidelberg (1995). doi: 10.1007\/3-540-59042-0_77"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01221098","volume":"6","author":"G Boudol","year":"1994","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A theory of processes with localities. Formal Asp. Comput. 6(2), 165\u2013200 (1994)","journal-title":"Formal Asp. Comput."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-60218-6_11","volume-title":"CONCUR \u201995: Concurrency Theory","author":"N Busi","year":"1995","unstructured":"Busi, N., Gorrieri, R.: A Petri net semantics for $$\\pi $$ -calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 145\u2013159. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60218-6_11"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/B978-044482830-9\/50033-3","volume-title":"Handbook of Process Algebra","author":"I Castellani","year":"2001","unstructured":"Castellani, I.: Process algebras with localities. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 945\u20131045. Elsevier, Amsterdam (2001). Chap. 15"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cattani, G.L., Sewell, P.: Models for name-passing processes: interleaving and causal. In: LICS, pp. 322\u2013333. IEEE Computer Society (2000). http:\/\/dx.doi.org\/10.1109\/LICS.2000.855781","DOI":"10.1109\/LICS.2000.855781"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s100090050035","volume":"2","author":"E Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Minea, M., Peled, D.: State space reduction using partial order techniques. Int. J. Softw. Tools Technol. Transf. 2(3), 279\u2013287 (1999). http:\/\/dx.doi.org\/10.1007\/s100090050035","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-28729-9_15","volume-title":"Foundations of Software Science and Computational Structures","author":"S Crafa","year":"2012","unstructured":"Crafa, S., Varacca, D., Yoshida, N.: Event structure semantics of parallel extrusion in the pi-calculus. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 225\u2013239. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-28729-9_15"},{"key":"3_CR11","unstructured":"Cristescu, I.: Operational and denotational semantics for the reversible $$\\pi $$ - calculus. Ph.D. thesis, Universit\u00e9 Paris Diderot - Paris 7 - Sorbonne Paris Cit\u00e9 (2015). http:\/\/www.pps.univ-paris-diderot.fr\/~ioana\/these.pdf"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible pi-calculus. In: ACM\/IEEE Symposium on Logic in Computer Science, LICS. pp. 388\u2013397. IEEE Computer Society (2013). http:\/\/dx.doi.org\/10.1109\/LICS.2013.45","DOI":"10.1109\/LICS.2013.45"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/BFb0013030","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"P Degano","year":"1989","unstructured":"Degano, P., Nicola, R., Montanari, U.: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: Bakker, J.W., Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 438\u2013466. Springer, Heidelberg (1989). doi: 10.1007\/BFb0013030"},{"issue":"4\/5","key":"3_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"R Glabbeek van","year":"2001","unstructured":"van Glabbeek, R., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Inform. 37(4\/5), 229\u2013327 (2001). http:\/\/link.springer.de\/link\/service\/journals\/00236\/bibs\/1037004\/10370229.htm","journal-title":"Acta Inform."},{"key":"3_CR15","unstructured":"Hildebrandt, T.T.: Categorical models for concurrency: independence, fairness and dataflow. Ph.D. thesis, University of Aarhus, Denmark (1999)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-60043-4_59","volume-title":"Algebraic Methodology and Software Technology","author":"L Jategaonkar Jagadeesan","year":"1995","unstructured":"Jategaonkar Jagadeesan, L., Jagadeesan, R.: Causality and true concurrency: a data-flow analysis of the pi-calculus. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 277\u2013291. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60043-4_59"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.B.: Reversibility in the higher-order pi-calculus. Theoret. Comput. Sci. 625, 25\u201384 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems, vol. 92. Springer, Berlin (1980)"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I-II. Inf. Comput. 100(1), 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S1571-0661(04)00024-6","volume":"1","author":"U Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Concurrent semantics for the pi-calculus. Electron. Notes Theoret. Comput. Sci. 1, 411\u2013429 (1995). http:\/\/dx.doi.org\/10.1016\/S1571-0661(04)00024\u20136","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-56287-7_116","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M Mukund","year":"1992","unstructured":"Mukund, M., Nielsen, M.: CCS, locations and asynchronous transition systems. In: Shyamasundar, R. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 328\u2013341. Springer, Heidelberg (1992). doi: 10.1007\/3-540-56287-7_116"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0022474","volume-title":"Semantics of Concurrent Computation","author":"M Nielsen","year":"1979","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 266\u2013284. Springer, Heidelberg (1979). doi: 10.1007\/BFb0022474"},{"key":"3_CR23","unstructured":"Normann, H., Johansen, C., Hildebrandt, T.: Non-interleaving operational semantics for the pi-calculus (long version). Technical report 453, Department of Informatics, University of Oslo (2016). http:\/\/heim.ifi.uio.no\/~cristi\/papers\/TR453.pdf"},{"issue":"XI","key":"3_CR24","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"4","author":"A Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.: Behaviour structures and nets. Fundamenta Informaticae 4(XI), 357\u2013404 (1988)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(95)00020-8","volume":"155","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Locality and interleaving semantics in calculi for mobile processes. Theoret. Comput. Sci. 155(1), 39\u201383 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The $$\\pi $$ -Calculus: A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$ -Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"issue":"5","key":"3_CR27","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"MW Shields","year":"1985","unstructured":"Shields, M.W.: Concurrent machines. Comput. J. 28(5), 449\u2013465 (1985)","journal-title":"Comput. J."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-08494-7_1","volume-title":"Reversible Computation","author":"I Ulidowski","year":"2014","unstructured":"Ulidowski, I., Phillips, I., Yuen, S.: Concurrency and reversibility. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 1\u201314. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-08494-7_1"},{"key":"3_CR29","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"G Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Abramski, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, pp. 1\u2013148. Oxford Universtiy Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T11:16:33Z","timestamp":1749986193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}