{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:56:55Z","timestamp":1761598615625},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242878"},{"type":"electronic","value":"9783642242885"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24288-5_20","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T05:46:57Z","timestamp":1316843217000},"page":"231-244","source":"Crossref","is-referenced-by-count":0,"title":["Reachability for Finite-State Process Algebras Using Static Analysis"],"prefix":"10.1007","author":[{"given":"Nataliya","family":"Skrypnyuk","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Principles of Model Checking (Representation and Mind Series)","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press, Cambridge (2008)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-44667-2_5","volume-title":"Lectures on Formal Methods and Performance Analysis","author":"E. Brinksma","year":"2001","unstructured":"Brinksma, E., Hermanns, H.: Process Algebra and Markov Chains. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol.\u00a02090, pp. 183\u2013231. Springer, Heidelberg (2001)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial order approach to branching time logic model checking. In: Proceedings of ISTCS 1995 (1995)","DOI":"10.1109\/ISTCS.1995.377038"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-45804-2_6","volume-title":"Interactive Markov Chains","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains. LNCS, vol.\u00a02428, pp. 129\u2013154. Springer, Heidelberg (2002)"},{"key":"20_CR5","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":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.L.: Principles of Program Analysis. Springer, Heidelberg (1999) Second printing, 2005"},{"key":"20_CR8","unstructured":"Nielson, F., Nielson, H.R., Priami, C., Rosa, D.: Static analysis for systems biology. In: Proceedings of WISICT 2004. Trinity College Dublin (2004)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-71322-7_15","volume-title":"Program Analysis and Compilation, Theory and Practice","author":"H.R. Nielson","year":"2007","unstructured":"Nielson, H.R., Nielson, F.: Data flow analysis for CCS. In: Reps, T., Sagiv, M., Bauer, J. (eds.) Wilhelm Festschrift. LNCS, vol.\u00a04444, pp. 311\u2013327. Springer, Heidelberg (2007)"},{"issue":"4","key":"20_CR10","first-page":"365","volume":"35","author":"H.R. Nielson","year":"2009","unstructured":"Nielson, H.R., Nielson, F.: A monotone framework for CCS. Comput. Lang. Syst. Struct.\u00a035(4), 365\u2013394 (2009)","journal-title":"Comput. Lang. Syst. Struct."},{"key":"20_CR11","unstructured":"Pilegaard, H.: Language Based Techniques for Systems Biology. PhD thesis, Technical University of Denmark (2007)"},{"key":"20_CR12","unstructured":"Plotkin, G.D.: A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus (1981)"},{"key":"20_CR13","unstructured":"Skrypnyuk, N.: Verification of Stochastic Process Calculi. PhD thesis, Technical University of Denmark (2011)"},{"key":"20_CR14","unstructured":"Skrypnyuk, N., Nielson, F.: Pathway Analysis for IMC. Journal of Logic and Algebraic Programming (to appear)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24288-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T20:38:09Z","timestamp":1554669489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24288-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242878","9783642242885"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24288-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}