{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:38:03Z","timestamp":1778279883893,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642180972","type":"print"},{"value":"9783642180989","type":"electronic"}],"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-18098-9_10","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"87-94","source":"Crossref","is-referenced-by-count":3,"title":["From Sequential Extended Regular Expressions to NFA with Symbolic Labels"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Cimatti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Mover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Roveri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tonetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"IEEE Standard for Property Specification Language (PSL). IEEE Std 1850-2005 (2005)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11605157_3","volume-title":"Implementation and Application of Automata","author":"P. Aziz Abdulla","year":"2006","unstructured":"Aziz Abdulla, P., Deneux, J., Kaati, L., Nilsson, M.: Minimization of non-deterministic automata with large alphabets. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 31\u201342. Springer, Heidelberg (2006)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Boule, M., Zilic, Z.: Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation. In: ASP-DAC, pp. 324\u2013329 (2007)","DOI":"10.1109\/ASPDAC.2007.358006"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S0129054102000972","volume":"13","author":"J.-M. Champarnaud","year":"2002","unstructured":"Champarnaud, J.-M.: Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. Int. J. Found. Comput. Sci.\u00a013(1), 99\u2013113 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","volume":"12","author":"J.M. Champarnaud","year":"1991","unstructured":"Champarnaud, J.M., Hansel, G.: Automate, a computing package for automata and finite semigroups. J. Symb. Comput.\u00a012(2), 197\u2013220 (1991)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/00207169908804865","volume":"72","author":"J.-M. Champarnaud","year":"1999","unstructured":"Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.: From Regular Expressions to Finite Automata. International Journal of Computer Mathematics\u00a072(4), 415\u2013431 (1999)","journal-title":"International Journal of Computer Mathematics"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A. Cimatti","year":"2000","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NUSMV: A New Symbolic Model Checker. STTT\u00a02(4), 410\u2013425 (2000)","journal-title":"STTT"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Roveri, M., Tonetta, S.: Symbolic Compilation of PSL. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1737\u20131750 (2008)","DOI":"10.1109\/TCAD.2008.2003303"},{"key":"10_CR9","volume-title":"Model checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Henriksen, J.G., Jensen, J., J\u00f8rgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice (1995)","DOI":"10.7146\/brics.v2i21.19923"},{"key":"10_CR11","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ilie, L., Navarro, G., Yu, S.: On NFA Reductions. In: Theory is Forever, pp. 112\u2013124 (2004)","DOI":"10.1007\/978-3-540-27812-2_11"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BFb0029017","volume-title":"STACS 1989","author":"V. Kell","year":"1989","unstructured":"Kell, V., Maier, A., Potthoff, A., Thomas, W., Wermuth, U.: AMORE: a system for computing automata, monoids and regular expressions. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol.\u00a0349, pp. 537\u2013538. Springer, Heidelberg (1989)"},{"key":"10_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems, Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer Verlag, New York (1992)"},{"key":"10_CR15","unstructured":"Pill, I.: Requirements Engineering and Efficient Verification of PSL properties. PhD thesis, Graz Univeristy of Technology (2008)"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"D. Raymond","year":"1994","unstructured":"Raymond, D., Wood, D.: Grail: a C++ library for automata and expressions. J. Symb. Comput.\u00a017(4), 341\u2013350 (1994)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1012291501330","volume":"4","author":"G. Noord van","year":"2001","unstructured":"van Noord, G., Gerdemann, D.: Finite State Transducers with Predicates and Identities. Grammars\u00a04(3), 263\u2013286 (2001)","journal-title":"Grammars"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Veanes, M., Grigorenko, P., de Halleux, P., Tillmann, N.: Rex: Symbolic Regular Expression Explorer. In: ICST (2010)","DOI":"10.1109\/ICST.2010.15"},{"key":"10_CR19","volume-title":"A Practical Guide for SystemVerilog Assertions","author":"S. Vijayaraghavan","year":"2005","unstructured":"Vijayaraghavan, S., Ramanathan, M.: A Practical Guide for SystemVerilog Assertions. Springer, Heidelberg (2005)"},{"key":"10_CR20","unstructured":"Watson, B.W.: A Taxonomy of Finite Automata Construction Algorithms. Technical report, Eindohoven University of Technology \u2013 Mathematics and Computing Science (1994)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-85114-1_21","volume-title":"Model Checking Software","author":"F. Yu","year":"2008","unstructured":"Yu, F., Bultan, T., Cova, M., Ibarra, O.H.: Symbolic String Verification: An Automata-Based Approach. In: Havelund, K., Majumdar, R. (eds.) SPIN 2008. LNCS, vol.\u00a05156, pp. 306\u2013324. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:18:50Z","timestamp":1559974730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}