{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:37Z","timestamp":1725663877999},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:10:32Z","timestamp":1330240232000},"page":"453-462","source":"Crossref","is-referenced-by-count":0,"title":["An expressive logic for Basic Process Algebra"],"prefix":"10.1007","author":[{"given":"A.","family":"Fantechi","sequence":"first","affiliation":[]},{"given":"S.","family":"Gnesi","sequence":"additional","affiliation":[]},{"given":"V.","family":"Perticaroli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten, J. A. Bergstra, J. W. Klop: Decidibility of bisimulation equivalence for processes generating context-free languages. Tech. Rep. CS-R8632, CWI, 1987.","key":"37_CR1","DOI":"10.1007\/3-540-17945-3_5"},{"key":"37_CR2","first-page":"62","volume":"398","author":"B. Banieqbal","year":"1989","unstructured":"B. Banieqbal, H. Barringer: Temporal Logic Fixed Point Calculus. Proc. Colloquium on Temporal Logic and Specification, LNCS 398, pp. 62\u201374, 1989.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, A. Pnueli: Now You May Compose Temporal Logic Specifications. Proceedings 16th ACM Symposium on the Theory of Computing, 1984.","key":"37_CR3","DOI":"10.1145\/800057.808665"},{"key":"37_CR4","first-page":"61","volume-title":"CWI Monograph 4","author":"J. A. Bergstra","year":"1986","unstructured":"J. A. Bergstra, J. W. Klop: Process algebra: specification and verification in bisimulation semantics. In: CWI Monograph 4, Proc. of the CWI Symposium Mathematics and Computer Science II, North-Holland, pp. 61\u201394, Amsterdam 1986."},{"key":"37_CR5","first-page":"50","volume":"354","author":"J. A. Bergstra","year":"1988","unstructured":"J. A. Bergstra & J. W. Klop: Process theory based on bisimulation semantics. LNCS 354, pp. 50\u2013122, 1988.","journal-title":"LNCS"},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M. C. Browne","year":"1988","unstructured":"M. C. Browne, E. M. Clarke, O. Gr\u00fcmberg: Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theor. Comp. Sci. vol. 59, pp. 115\u2013131, 1988.","journal-title":"Theor. Comp. Sci."},{"key":"37_CR7","first-page":"123","volume":"630","author":"O. Burkart","year":"1992","unstructured":"O. Burkart, B. Steffen: Model Checking for Context-Free Processes. Proceedings CONCUR 92, LNCS 630, pp.123\u2013137, 1992.","journal-title":"LNCS"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E. A. Emerson","year":"1986","unstructured":"E. A. Emerson, J. Y. Halpern: \u201cSometimes\u201d and \u201cNot Never\u201d Rivisited: On Branching versus Linear Time Temporal Logic. Journal of ACM vol. 33, pp.151\u2013178, 1986.","journal-title":"Journal of ACM"},{"unstructured":"E. A. Emerson, C. Lei: Efficient Model Checking in Fragments of the Propositional Mu-Calculus, Proc. Symposium on Logics in Computer Science, 1986, pp. 267\u2013278.","key":"37_CR9"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(91)90163-C","volume":"39","author":"A. Fantechi","year":"1991","unstructured":"A. Fantechi, S. Gnesi, G. Ristori: Compositionality and Bisimulation: a Negative Result. Information Processing Letters, vol. 39, pp. 109\u2013114, 1991.","journal-title":"Information Processing Letters"},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF00288467","volume":"23","author":"S. Graf","year":"1986","unstructured":"S. Graf, J, Sifakis: A Logic for Specification and Proof of Regular Controllable Processes of CCS. Acta Informatica, vol 23, pp. 507\u2013527, 1986.","journal-title":"Acta Informatica"},{"key":"37_CR12","first-page":"423","volume":"372","author":"J. F. Groote","year":"1989","unstructured":"J. F. Groote, F. W. Vaandrager: Structured Operational Semantics and Bisimulation as a Congruence. Proc. 16th ICALP, LNCS 372, pp.423\u2013438, 1989.","journal-title":"LNCS"},{"key":"37_CR13","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy: Algebraic Theory of Processes.MIT Press, Cambridge, 1988."},{"unstructured":"H. H\u00fcttel, C. Stirling: Actions Speak Louder than Words: Proving Bisimilarity of Context-Free Processes. Proc. LICS 91, Computer Society Press, 1991.","key":"37_CR14"},{"key":"37_CR15","first-page":"179","volume":"407","author":"B. Jonsson","year":"1990","unstructured":"B. Jonsson, H. Khan, J. Parrow: Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. In: Automatic Verification Methods for Finite State Systems, LNCS 407, pp. 179\u2013188, 1990.","journal-title":"LNCS"},{"key":"37_CR16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen: Results on the Propositional \u03bc-calculus. Theor. Comp. Sci. vol. 27, pp. 333\u2013354, 1983.","journal-title":"Theor. Comp. Sci."},{"doi-asserted-by":"crossref","unstructured":"R. Milner: A calculus of communicating system. LNCS 92, 1980.","key":"37_CR17","DOI":"10.1007\/3-540-10235-3"},{"key":"37_CR18","first-page":"167","volume":"104","author":"D. M. R. R. Park","year":"1981","unstructured":"D. M. R. Park: Concurrency and automata on infinite sequences. Proc. 5th GI Conference, LNCS 104, pp. 167\u2013183 1981.","journal-title":"LNCS"},{"key":"37_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"A. Pnueli: The Temporal Semantics of Concurrent Programs Theor. Comp. Sci., vol.13, 1981, pp.45\u201360.","journal-title":"Theor. Comp. Sci."},{"unstructured":"A. Pnueli: Linear and Branching Structures in the Semantics and Logic of Reactive Systems. Proc. 12th ICALP, LNCS 194, 1985.","key":"37_CR20"},{"key":"37_CR21","first-page":"723","volume":"372","author":"B. Steffen","year":"1989","unstructured":"B. Steffen: Characteristic Formulae. Proc. 16th ICALP, LNCS 372, pp.723\u2013732, 1989.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:08:40Z","timestamp":1605629320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}