{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:33:14Z","timestamp":1743143594934,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_35","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T06:19:21Z","timestamp":1232605161000},"page":"376-387","source":"Crossref","is-referenced-by-count":5,"title":["Safe Reasoning with Logic LTS"],"prefix":"10.1007","author":[{"given":"Gerald","family":"L\u00fcttgen","sequence":"first","affiliation":[]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90151-I","volume":"114","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Plotkin, G.: A logical view of composition. TCS\u00a0114(1), 3\u201330 (1993)","journal-title":"TCS"},{"key":"35_CR2","unstructured":"Bloom, B.: Ready Simulation, Bisimulation, and the Semantics of CCS-like Languages. PhD thesis, MIT (1990)"},{"issue":"3","key":"35_CR3","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.W.: A theory of communicating sequential processes. J. ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-53479-2_17","volume-title":"Semantics of Systems of Concurrent Processes","author":"R. De Nicola","year":"1990","unstructured":"De Nicola, R., Vaandrager, F.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.\u00a0469, pp. 407\u2013419. Springer, Heidelberg (1990)"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75698-9_1","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"H. Fecher","year":"2007","unstructured":"Fecher, H., Grabe, I.: Finite abstract models for deterministic transition systems. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol.\u00a04767, pp. 1\u201316. Springer, Heidelberg (2007)"},{"key":"35_CR6","unstructured":"van Glabbeek, R.: The linear time \u2013 branching time spectrum II (1993), http:\/\/theory.stanford.edu\/~rvg\/abstracts.html#26"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Guerra, H., Costa, J.F.: Processes with local and global liveness requirements. J. of Logic and Algebraic Programming (to appear, 2008)","DOI":"10.1016\/j.jlap.2008.08.003"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-46419-0_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Rajamani, S.K.: Fair bisimulation. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 299\u2013314. Springer, Heidelberg (2000)"},{"key":"35_CR9","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"35_CR10","volume-title":"Unif. Theories of Programming","author":"C.A.R. Hoare","year":"1998","unstructured":"Hoare, C.A.R., Jifeng, H.: Unif. Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"35_CR11","volume-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"R.P. Kurshan","year":"1994","unstructured":"Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Lamport, L.: The temporal logic of actions. TOPLAS\u00a016(3), 872\u2013923 (1994)","journal-title":"TOPLAS"},{"issue":"1\u20132","key":"35_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2006.10.022","volume":"373","author":"G. L\u00fcttgen","year":"2007","unstructured":"L\u00fcttgen, G., Vogler, W.: Conjunction on processes: Full-abstraction via ready-tree semantics. TCS\u00a0373(1\u20132), 19\u201340 (2007)","journal-title":"TCS"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-540-73420-8_65","volume-title":"Automata, Languages and Programming","author":"G. L\u00fcttgen","year":"2007","unstructured":"L\u00fcttgen, G., Vogler, W.: Ready simulation for concurrency: It\u2019s logical? In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 752\u2013763. Springer, Heidelberg (2007)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., Vogler, W.: Safe reasoning with Logic LTS. Technical report, Comp. Sci. Inst., Univ. of Augsburg, Germany (to appear, 2008)","DOI":"10.1007\/978-3-540-95891-8_35"},{"key":"35_CR16","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526589","volume-title":"Nets, Terms and Formulas","author":"E.-R. Olderog","year":"1991","unstructured":"Olderog, E.-R.: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science, vol.\u00a023. Cambridge Univ. Press, Cambridge (1991)"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-44685-0_14","volume-title":"CONCUR 2001 - Concurrency Theory","author":"A. Puhakka","year":"2001","unstructured":"Puhakka, A., Valmari, A.: Liveness and fairness in process-algebraic verification. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 202\u2013217. Springer, Heidelberg (2001)"},{"key":"35_CR18","series-title":"ENTCS","volume-title":"Formal Aspects of Component Software","author":"J.-B. Raclet","year":"2008","unstructured":"Raclet, J.-B.: Residual for component specifications. In: Formal Aspects of Component Software. ENTCS, vol.\u00a0215. Elsevier, Amsterdam (2008)"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-45719-4_15","volume-title":"Algebraic Methodology and Software Technology","author":"I. Ulidowski","year":"2002","unstructured":"Ulidowski, I.: Refusal simulation and interactive games. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 208\u2013222. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T17:56:52Z","timestamp":1684864612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}