{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T01:42:09Z","timestamp":1790905329733,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642329395","type":"print"},{"value":"9783642329401","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_12","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T16:47:02Z","timestamp":1346518022000},"page":"147-161","source":"Crossref","is-referenced-by-count":5,"title":["A Comparison of Succinctly Represented Finite-State Systems"],"prefix":"10.1007","author":[{"given":"Romain","family":"Brenguier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"G\u00f6ller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814105","volume-title":"Reactive Systems: Modelling, Specification and Verification","author":"L. Aceto","year":"2007","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, NY (2007)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/503502.503503","volume":"23","author":"R. Alur","year":"2001","unstructured":"Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst.\u00a023(3), 273\u2013303 (2001)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J.E. Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed Automata: Semantics, Algorithms and Tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-17511-4_8","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Bozzelli","year":"2010","unstructured":"Bozzelli, L., Legay, A., Pinchinat, S.: Hardness of Preorder Checking for Basic Formalisms. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 119\u2013135. Springer, Heidelberg (2010)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00224-009-9227-1","volume":"48","author":"S. G\u00f6ller","year":"2011","unstructured":"G\u00f6ller, S., Lohrey, M.: Fixpoint logics over hierarchical structures. Theory Comput. Syst.\u00a048(1), 93\u2013131 (2011)","journal-title":"Theory Comput. Syst."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.2001.2920","volume":"173","author":"D. Harel","year":"2002","unstructured":"Harel, D., Kupferman, O., Vardi, M.Y.: On the complexity of verifying concurrent transition systems. Inf. Comput.\u00a0173, 143\u2013161 (2002)","journal-title":"Inf. Comput."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 263\u2013277. Springer, Heidelberg (1996)"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","volume":"154","author":"L. Jategaonkar","year":"1996","unstructured":"Jategaonkar, L., Meyer, A.R.: Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science\u00a0154(1), 107\u2013143 (1996)","journal-title":"Theoretical Computer Science"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-71209-1_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Laroussinie, F., Sproston, J.: Model Checking Probabilistic Timed Automata with One or Two Clocks. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 170\u2013184. Springer, Heidelberg (2007)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/3-540-45694-5_39","volume-title":"CONCUR 2002 - Concurrency Theory","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: Why Is Simulation Harder than Bisimulation? In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 594\u2013610. Springer, Heidelberg (2002)"},{"issue":"7","key":"12_CR12","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.ic.2010.01.003","volume":"208","author":"A. Ku\u010dera","year":"2010","unstructured":"Ku\u010dera, A., Mayr, R.: On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Information and Computation\u00a0208(7), 772\u2013796 (2010)","journal-title":"Information and Computation"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-46432-8_13","volume-title":"Foundation of Software Science and Computation Structures","author":"F. Laroussinie","year":"2000","unstructured":"Laroussinie, F., Schnoebelen, P.: The State Explosion Problem from Trace to Bisimulation Equivalence. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 192\u2013207. Springer, Heidelberg (2000)"},{"issue":"6","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0217068","volume":"17","author":"T. Lengauer","year":"1988","unstructured":"Lengauer, T., Wanke, E.: Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput.\u00a017(6), 1063\u20131080 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.jcss.2011.05.006","volume":"78","author":"M. Lohrey","year":"2012","unstructured":"Lohrey, M.: Model-checking hierarchical structures. J. Comput. Syst. Sci.\u00a078(2), 461\u2013490 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0890-5401(03)00104-4","volume":"184","author":"F. Moller","year":"2003","unstructured":"Moller, F., Rabinovich, A.M.: Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput.\u00a0184(1), 147\u2013159 (2003)","journal-title":"Inf. Comput."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Muscholl, A., Walukiewicz, I.: A lower bound on web services composition. Logical Methods in Computer Science\u00a04(2) (2008)","DOI":"10.2168\/LMCS-4(2:5)2008"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-85778-5_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J. Srba","year":"2008","unstructured":"Srba, J.: Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 15\u201332. Springer, Heidelberg (2008)"},{"key":"12_CR19","unstructured":"van Benthem, J.: Modal Correspondence Theory. PhD thesis, University of Amsterdam (1976)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The Linear Time-Branching Time Spectrum (Extended Abstract). In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:13:21Z","timestamp":1558300401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}