{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:07:44Z","timestamp":1770350864052,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035794","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"723-732","source":"Crossref","is-referenced-by-count":39,"title":["Characteristic formulae"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Steffen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"E. Clarke, E. A. Emerson and A.P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications: A Practical Approach, ACM 1983","DOI":"10.1145\/567067.567080"},{"key":"47_CR2","volume-title":"Reasoning About Networks With Many Identical Finite-State Processes","author":"E. Clarke","year":"1986","unstructured":"E. Clarke, O. Grumberg and M.C. Browne. Reasoning About Networks With Many Identical Finite-State Processes, Carnegie Mellon University, Pittsburg, October 1986"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"R. Cleaveland. Tableau-Based Model Checking in the Propositional Mu-Calculus, University of Sussex, Brighton, Technical Report 2\u201389, 1989","DOI":"10.1007\/BF00264284"},{"key":"47_CR4","first-page":"567","volume":"74","author":"G. Cousineau","year":"1979","unstructured":"G. Cousineau and M. Nivat. On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts, 8th MFCS, LNCS 74, pp. 567\u2013580, 1979","journal-title":"LNCS"},{"key":"47_CR5","unstructured":"R. Cleaveland, J. G. Parrow and B. Steffen. The Concurrency Workbench: Operating Instructions, University of Edinburgh, Laboratory for Foundations of Computer Science, Technical Notes 10, September 1988"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. G. Parrow and B. Steffen. The Concurrency Workbench, Accepted for the Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, 1989","DOI":"10.1007\/3-540-52148-8_3"},{"key":"47_CR7","unstructured":"R. Cleaveland, J. G. Parrow and B. Steffen. A Semantics based Verification Tool for Finite State Systems, to appear in the proceedings of the Ninth International Symposium on Protocol Specification, Testing, and Verification; North Holland, 1989"},{"key":"47_CR8","unstructured":"E. A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus, LICS, Cambridge, Mass., IEEE, 1986"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(86)80031-6","volume":"68","author":"S. Graf","year":"1986","unstructured":"S. Graf and J. Sifakis. A Modal Characterization of Observational Congruence on Finite Terms of CCS, Information and Control, pp. 125\u2013145, Vol 68, 1986","journal-title":"Information and Control"},{"key":"47_CR10","unstructured":"S. Holmstr\u00f6m. Hennessy-Milner Logic with Recursion as a Specification Language, and a Refinement Calculus based on it, Report 44 Programming Methodology Group, University of G\u00f6teborg, 1988"},{"key":"47_CR11","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 Mu-Calculus, TCS 27, pp. 333\u2013354, North Holland, 1983","journal-title":"TCS"},{"key":"47_CR12","unstructured":"K. Larsen. Proof Systems for Hennessy-Milner Logic with Recursion, in Proceedings CAAP 1988"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"A.R. Meyer and K.A. Winklmann. On the Expressive Power of Dynamic Logics, 11th STOC, ACM, pp. 167\u2013175, 1979","DOI":"10.1145\/800135.804410"},{"key":"47_CR14","unstructured":"R. Milner. A Calculus for Communicating Systems, LNCS 92"},{"key":"47_CR15","first-page":"25","volume":"112","author":"R. Milner","year":"1981","unstructured":"R. Milner. A Modal Characterization of Observable Machine-Behaviour, LNCS 112, pp. 25\u201334, Berlin 1981","journal-title":"LNCS"},{"key":"47_CR16","unstructured":"R. Milner. Communication and Concurrency, Prentice Hall, 1989"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"G. Plotkin and C. Stirling. A Framework for Intuitionistic Modal Logics, Theoretical Aspects of Reasoning about Knowledge, Monterey, 1986","DOI":"10.1016\/B978-0-934613-04-0.50032-6"},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"B. Steffen. Characteristic Formulae for CCS with Divergence, University of Edinburgh, Laboratory for Foundations of Computer Science, Technical Report ECS-LFCS-89-76, 1989","DOI":"10.1007\/BFb0035794"},{"key":"47_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling. Modal Logics for Communicating Systems, TCS 49, pp. 311\u2013347, 1987","journal-title":"TCS"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"C. Stirling and D. J. Walker. Local Model Checking in the Modal Mu-Calculus, in Proceedings CAAP 1989","DOI":"10.1007\/3-540-50939-9_144"},{"key":"47_CR21","unstructured":"D.J. Walker. Bisimulation and Divergence in CCS, in Proceedings LICS 1988"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:53:45Z","timestamp":1683309225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0035794","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}