{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:34Z","timestamp":1761611194283,"version":"3.32.0"},"reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084787","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"123-137","source":"Crossref","is-referenced-by-count":70,"title":["Model checking for context-free processes"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Burkart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. In PARLE '87, LNCS 259, pages 94\u2013113. Springer, 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"J.C. Bradfield. Verifying Temporal Properties of Systems with Applications to Petri Nets. PhD thesis, University of Edinburgh, 1991.","DOI":"10.1007\/978-1-4684-6819-9_4"},{"issue":"8","key":"10_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR4","unstructured":"J.C. Bradfield and C. Stirling. Local Model Checking for Infinite State Spaces. Technical Report ECS-LFCS-90-115, LFCS, June 1991."},{"issue":"4","key":"10_CR5","first-page":"339","volume":"24","author":"D. Caucal","year":"1990","unstructured":"D. Caucal. Graphes Canoniques de Graphes Alg\u00e9briques. RAIRO, 24(4):339\u2013352, 1990.","journal-title":"RAIRO"},{"key":"10_CR6","unstructured":"R. Cleaveland, M. Dreim\u00fcller, and B. Steffen. Faster Model Checking for the Modal Mu-Calculus. Accepted for CAV '92."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/BF00264284","volume":"27","author":"R. Cleaveland","year":"1990","unstructured":"R. Cleaveland. Tableau-Based Model Checking in the Propositional Mu-Calculus. Acta Informatica, 27:725\u2013747, 1990.","journal-title":"Acta Informatica"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench. In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, LNCS 407, pages 24\u201337. Springer, 1989.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and B. Steffen. Computing Behavioural Relations, Logically. In ICALP '91, LNCS 510. Springer, 1991.","DOI":"10.1007\/3-540-54233-7_129"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and B. Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. In CAV '91, LNCS 575, pages 48\u201358. Springer, 1992.","DOI":"10.1007\/3-540-55179-4_6"},{"key":"10_CR12","unstructured":"E.A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In Proc. 1th Annual Symp. on Logic in Computer Science, pages 267\u2013278. IEEE Computer Society Press, 1986."},{"key":"10_CR13","unstructured":"J.F. Groote. A Short Proof of the Decidability of Bisimulation for Normed bpa-Processes. Technical Report CS-R9151, CWI, December 1991."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and C. Stirling. Actions Speak Louder than Words: Proving Bisimularity for Context-Free Processes. In Proc. 6th Annual Symp. on Logic in Computer Science, pages 376\u2013386. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151661"},{"key":"10_CR15","volume-title":"Technical Report UTDCS-1-92","author":"D.T. Huynh","year":"1992","unstructured":"D.T. Huynh and L. Tian. Deciding Bisimilarity of Normed Context-Free Processes is in \u2211 2 p . Technical Report UTDCS-1-92, University of Texas at Dallas, 1992."},{"key":"10_CR16","doi-asserted-by":"publisher","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. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"K.G. Larsen. Proof Systems for Hennessy-Milner Logic with Recursion. In CAAP '88, LNCS 299, pages 215\u2013230. Springer, 1988.","DOI":"10.1007\/BFb0026106"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"C. Stirling and D. Walker. Local Model Checking in the Modal Mu-Calculus. In TAPSOFT '89, LNCS 351, pages 369\u2013383. Springer, 1989.","DOI":"10.1007\/3-540-50939-9_144"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics, 5:285\u2013309, 1955.","journal-title":"Pacific Journal of Mathematics"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"G. Winskel. A Note on Model Checking the Modal Mu-Calculus. In Automata, Languages and Programming, LNCS 372, pages 761\u2013772. Springer, 1989.","DOI":"10.1007\/BFb0035797"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084787.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:27Z","timestamp":1736654127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0084787","relation":{},"subject":[]}}