{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:28:38Z","timestamp":1725888518504},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602240"},{"type":"electronic","value":"9783319602257"}],"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-60225-7_13","type":"book-chapter","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T22:26:37Z","timestamp":1495837597000},"page":"179-193","source":"Crossref","is-referenced-by-count":0,"title":["Weak Nominal Modal Logic"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Parrow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tjark","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Borgstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars-Henrik","family":"Eriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL 2001, pp. 104\u2013115. ACM (2001)","DOI":"10.1145\/360204.360213"},{"issue":"1","key":"13_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. Inf. Comput. 148(1), 1\u201370 (1999)","journal-title":"Inf. Comput."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-70583-3_9","volume-title":"Automata, Languages and Programming","author":"M Berger","year":"2008","unstructured":"Berger, M., Honda, K., Yoshida, N.: Completeness and logical full abstraction in modal logics for typed mobile processes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 99\u2013111. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-70583-3_9"},{"issue":"3","key":"13_CR4","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1137\/S0097539700377864","volume":"31","author":"M Boreale","year":"2001","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM J. Comput. 31(3), 947\u2013986 (2001)","journal-title":"SIAM J. Comput."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bradfield, J.C., Stevens, P.: Observational mu-calculus. Technical report RS-99-5, BRICS (1999)","DOI":"10.7146\/brics.v6i5.20062"},{"issue":"3","key":"13_CR6","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-71316-6_3","volume-title":"Programming Languages and Systems","author":"MG Buscemi","year":"2007","unstructured":"Buscemi, M.G., Montanari, U.: CC-Pi: a constraint-based language for specifying service level agreements. In: Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 18\u201332. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71316-6_3"},{"key":"13_CR8","first-page":"103","volume":"286","author":"M Cimini","year":"2012","unstructured":"Cimini, M., Mousavi, M.R., Reniers, M.A., Gabbay, M.J.: Nominal SOS. ENTCS 286, 103\u2013116 (2012)","journal-title":"ENTCS"},{"issue":"28","key":"13_CR9","doi-asserted-by":"crossref","first-page":"3129","DOI":"10.1016\/j.tcs.2011.02.034","volume":"412","author":"S Cranen","year":"2011","unstructured":"Cranen, S., Groote, J.F., Reniers, M.: A linear translation from CTL* to the first-order modal $$\\mu $$ -calculus. Theoret. Comput. Sci. 412(28), 3129\u20133139 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"13_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M Dam","year":"1996","unstructured":"Dam, M.: Model checking mobile processes. Inf. Comput. 129(1), 35\u201351 (1996)","journal-title":"Inf. Comput."},{"issue":"1","key":"13_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1017\/S0960129507006585","volume":"18","author":"R Nicola De","year":"2008","unstructured":"De Nicola, R., Loreti, M.: Multiple-labelled transition systems for nominal calculi and their logics. Math. Struct. Comput. Sci. 18(1), 107\u2013143 (2008)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"13_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.ic.2007.12.005","volume":"207","author":"M Fiore","year":"2009","unstructured":"Fiore, M., Staton, S.: A congruence rule format for name-passing process calculi. Inf. Comput. 207(2), 209\u2013236 (2009)","journal-title":"Inf. Comput."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: Bakker, J., Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299\u2013309. Springer, Heidelberg (1980). doi: 10.1007\/3-540-10003-2_79"},{"issue":"1","key":"13_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"13_CR15","first-page":"139","volume":"173","author":"H H\u00fcttel","year":"2007","unstructured":"H\u00fcttel, H., Pedersen, M.D.: A logical characterisation of static equivalence. ENTCS 173, 139\u2013157 (2007). Proceedings of MFPS XXIII","journal-title":"ENTCS"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Johansson, M., Bengtson, J., Parrow, J., Victor, B.: Weak equivalences in psi-calculi. In: Proceedings of LICS 2010, pp. 322\u2013331 (2010)","DOI":"10.1109\/LICS.2010.30"},{"issue":"3","key":"13_CR17","first-page":"242","volume":"38","author":"V Koutavas","year":"2012","unstructured":"Koutavas, V., Hennessy, M.: First-order reasoning for higher-order concurrency. Comput. Lang. Syst. Struct. 38(3), 242\u2013277 (2012)","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"3","key":"13_CR18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$ -calculus. Theoret. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Lamport, L.: What good is temporal logic? In: IFIP Congress, pp. 657\u2013668 (1983)","DOI":"10.1145\/2402.322398"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol. 92. Springer, Heidelberg (1980). doi: 10.1007\/3-540-10235-3"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-10828-9_52","volume-title":"CAAP \u201981","author":"R Milner","year":"1981","unstructured":"Milner, R.: A modal characterisation of observable machine-behaviour. In: Astesiano, E., B\u00f6hm, C. (eds.) CAAP 1981. LNCS, vol. 112, pp. 25\u201334. Springer, Heidelberg (1981). doi: 10.1007\/3-540-10828-9_52"},{"issue":"1","key":"13_CR22","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(93)90156-N","volume":"114","author":"R Milner","year":"1993","unstructured":"Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. Theoret. Comput. Sci. 114(1), 149\u2013171 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR23","unstructured":"Parrow, J., Borgstr\u00f6m, J., Eriksson, L.-H., Gutkovas, R., Weber, T.: Modal logics for nominal transition systems. In: Proceedings of CONCUR 2015. LIPIcs, vol. 42, pp. 198\u2013211. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"13_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139084673","volume-title":"Nominal Sets","author":"AM Pitts","year":"2013","unstructured":"Pitts, A.M.: Nominal Sets. Cambridge University Press, Cambridge (2013)"},{"key":"13_CR25","unstructured":"Weber, T., Eriksson, L.-H., Parrow, J., Borgstr\u00f6m, J., Gutkovas, R.: Modal logics for nominal transition systems. Archive of Formal Proofs, October 2016. http:\/\/isa-afp.org\/entries\/Modal_Logics_for_NTS.shtml . Formal proof development"},{"issue":"3","key":"13_CR26","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.tcs.2005.03.017","volume":"340","author":"L Wischik","year":"2005","unstructured":"Wischik, L., Gardner, P.: Explicit fusions. Theoret. Comput. Sci. 340(3), 606\u2013630 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"13_CR27","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s12204-014-1554-y","volume":"20","author":"X Xian","year":"2015","unstructured":"Xian, X., Long, H.: A logical characterization for linear higher-order processes. J. Shanghai Jiaotong Univ. (Sci.) 20(2), 185\u2013194 (2015)","journal-title":"J. Shanghai Jiaotong Univ. (Sci.)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60225-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T01:19:53Z","timestamp":1569374393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60225-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602240","9783319602257"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60225-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}