{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:36Z","timestamp":1761596976983},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11734673_15","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T17:59:04Z","timestamp":1151949544000},"page":"188-199","source":"Crossref","is-referenced-by-count":5,"title":["Verification of Pushdown Systems Using Omega Algebra with Domain"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Mathieu","sequence":"first","affiliation":[]},{"given":"Jules","family":"Desharnais","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/B978-044482830-9\/50027-8","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"2001","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier, Amsterdam (2001)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E. Cohen","year":"2000","unstructured":"Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"key":"15_CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"#cr-split#-15_CR4.1","unstructured":"Desharnais, J., M??ller, B., Struth, G.: Kleene algebra with domain. ACM Transactions on Computational Logic (to appear);"},{"key":"#cr-split#-15_CR4.2","unstructured":"Preliminary version: Report No. 2003-07, Universit??t Augsburg, Institut f??r Informatik (2003)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110, 366\u2013390 (1994)","journal-title":"Information and Computation"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a019, 427\u2013443 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-63172-0_43","volume-title":"Computer Science Logic","author":"D. Kozen","year":"1997","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol.\u00a01258, pp. 244\u2013259. Springer, Heidelberg (1997)"},{"key":"15_CR8","unstructured":"Mathieu, V.: V\u00e9rification des syst\u00e8mes \u00e0 pile au moyen des alg\u00e8bres de Kleene. Forthcoming Master\u2019s thesis, Universit\u00e9 Laval, Qu\u00e9bec, Canada (2006)"},{"key":"15_CR9","unstructured":"Schwoon, S.: Model-Checking Pushdown Systems. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2002)"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:30:41Z","timestamp":1552350641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11734673_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}