{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:41:38Z","timestamp":1725910898228},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319677286"},{"type":"electronic","value":"9783319677293"}],"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-67729-3_4","type":"book-chapter","created":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T05:04:04Z","timestamp":1505538244000},"page":"51-69","source":"Crossref","is-referenced-by-count":1,"title":["Logical Characterisation of Parameterised Bisimulations"],"prefix":"10.1007","author":[{"given":"Divyanshu","family":"Bagga","sequence":"first","affiliation":[]},{"given":"S. Arun","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,17]]},"reference":[{"unstructured":"Aceto, L., F\u00e1bregas, I., de Frutos-Escrig, D., Ing\u00f3lfsd\u00f3ttir, A., Palomino, M.: Graphical representation of covariant-contravariant modal formulae (2011). \narXiv:1108.4464","key":"4_CR1"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0960129511000375","volume":"22","author":"L Aceto","year":"2012","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., et al.: Characteristic formulae for fixed-point semantics. Math. Struct. Comput. Sci. 22, 125\u2013173 (2012)","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S.: On bisimilarities induced by relations on actions. In: SEFM 2006, pp. 41\u201349. IEEE (2006)","key":"4_CR4","DOI":"10.1109\/SEFM.2006.28"},{"issue":"8","key":"4_CR5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Inform. 29(8), 737\u2013760 (1992)","journal-title":"Acta Inform."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-540-39893-6_28","volume-title":"Formal Methods and Software Engineering","author":"J Bengtsson","year":"2003","unstructured":"Bengtsson, J., Yi, W.: On clock difference constraints and termination in reachability analysis of timed automata. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol. 2885, pp. 491\u2013503. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-39893-6_28"},{"unstructured":"Van Benthem, J.: Modal correspondence theory. Ph.D. thesis, University of Amsterdam (1976)","key":"4_CR7"},{"key":"4_CR8","volume-title":"Lattice Theory","author":"G Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory, vol. 25. American Mathematical Society, Providence (1967)"},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90276-L","volume":"106","author":"G Boudol","year":"1992","unstructured":"Boudol, G., Larsen, K.G.: Graphical versus logical specifications. Theoret. Comput. Sci. 106(1), 3\u201320 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-54233-7_129","volume-title":"Automata, Languages and Programming","author":"R Cleaveland","year":"1991","unstructured":"Cleaveland, R., Steffen, B.: Computing behavioural relations, logically. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 127\u2013138. Springer, Heidelberg (1991). doi:\n10.1007\/3-540-54233-7_129"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-03741-2_16","volume-title":"Algebra and Coalgebra in Computer Science","author":"I F\u00e1bregas","year":"2009","unstructured":"F\u00e1bregas, I., de Frutos Escrig, D., Palomino, M.: Non-strongly stable orders also define interesting simulation relations. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 221\u2013235. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-03741-2_16"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13464-7_18","volume-title":"Formal Techniques for Distributed Systems","author":"I F\u00e1bregas","year":"2010","unstructured":"F\u00e1bregas, I., de Frutos Escrig, D., Palomino, M.: Logics for contravariant simulations. In: Hatcliff, J., Zucca, E. (eds.) FMOODS\/FORTE -2010. LNCS, vol. 6117, pp. 224\u2013231. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13464-7_18"},{"key":"4_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542725","volume-title":"Continuous Lattices and Domains","author":"G Gierz","year":"2003","unstructured":"Gierz, G., Scott, D.S., et al.: Continuous Lattices and Domains, vol. 93. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"4_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(86)80031-6","volume":"68","author":"S Graf","year":"1986","unstructured":"Graf, S., Sifakis, J.: A modal characterization of observational congruence on finite terms of CCS. Inf. Control 68(1), 125\u2013145 (1986)","journal-title":"Inf. Control"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-31424-7_33","volume-title":"Computer Aided Verification","author":"S Guha","year":"2012","unstructured":"Guha, S., Narayan, C., Arun-Kumar, S.: On decidability of prebisimulation for timed automata. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 444\u2013461. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-31424-7_33"},{"issue":"1","key":"4_CR16","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":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-31862-0_9","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"N Korade","year":"2005","unstructured":"Korade, N., Arun-Kumar, S.: A logical characterization of efficiency preorders. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 99\u2013112. Springer, Heidelberg (2005). doi:\n10.1007\/978-3-540-31862-0_9"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/BFb0012782","volume-title":"Automata, Languages and Programming","author":"D Kozen","year":"1982","unstructured":"Kozen, D.: Results on the propositional \n            $$\\mu $$\n          -calculus. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 348\u2013359. Springer, Heidelberg (1982). doi:\n10.1007\/BFb0012782"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-60246-1_158","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic \u2014 and back. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 529\u2013539. Springer, Heidelberg (1995). doi:\n10.1007\/3-540-60246-1_158"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-58027-1_8","volume-title":"Mathematical Foundations of Programming Semantics","author":"KG Larsen","year":"1994","unstructured":"Larsen, K.G., Yi, W.: Time abstracted bisimulation: implicit specifications and decidability. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 160\u2013176. Springer, Heidelberg (1994). doi:\n10.1007\/3-540-58027-1_8"},{"key":"4_CR21","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S1571-0661(05)80257-9","volume":"18","author":"M M\u00fcller-Olm","year":"1998","unstructured":"M\u00fcller-Olm, M.: Derivation of characteristic formulae. Electron. Notes Theoret. Comput. Sci. 18, 159\u2013170 (1998)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"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. 104, pp. 167\u2013183. Springer, Heidelberg (1981). doi:\n10.1007\/BFb0017309"},{"issue":"4","key":"4_CR24","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/1516507.1516510","volume":"31","author":"D Sangiorgi","year":"2009","unstructured":"Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4), 15:1\u201315:41 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"unstructured":"Logical characterisation proofs, July 2017. \nhttp:\/\/www.cse.iitd.ac.in\/~bagga\/detailedProofs.pdf","key":"4_CR25"},{"unstructured":"Timed bisimulations as parameterised bisimulations, July 2017. \nhttp:\/\/www.cse.iitd.ac.in\/~bagga\/TimedBisimulations.pdf","key":"4_CR26"},{"issue":"1","key":"4_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1994.1028","volume":"110","author":"B Steffen","year":"1994","unstructured":"Steffen, B., Ing\u00f3lfsd\u00f3ttir, A.: Characteristic formulas for processes with divergence. Inf. Comput. 110(1), 149\u2013163 (1994)","journal-title":"Inf. Comput."},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume-title":"Logics for Concurrency","author":"C Stirling","year":"1996","unstructured":"Stirling, C.: Modal and temporal logics for processes. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 149\u2013237. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-60915-6_5"},{"issue":"2","key":"4_CR29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A., et al.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"4_CR30","series-title":"Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science)","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-94-009-6259-0_4","volume-title":"Handbook of Philosophical Logic","author":"J Benthem Van","year":"1984","unstructured":"Van Benthem, J.: Correspondence theory. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic. Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science), vol. 165, pp. 167\u2013247. Springer, Heidelberg (1984). doi:\n10.1007\/978-94-009-6259-0_4"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR 1990 Theories of Concurrency: Unification and Extension","author":"RJ Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278\u2013297. Springer, Heidelberg (1990). doi:\n10.1007\/BFb0039066"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67729-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T05:05:06Z","timestamp":1505538306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67729-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319677286","9783319677293"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67729-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}