{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T13:49:11Z","timestamp":1677764951272},"reference-count":53,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1016\/j.jcss.2011.05.006","type":"journal-article","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T15:37:07Z","timestamp":1305905827000},"page":"461-490","source":"Crossref","is-referenced-by-count":6,"title":["Model-checking hierarchical structures"],"prefix":"10.1016","volume":"78","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jcss.2011.05.006_br0010","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1145\/1075382.1075387","article-title":"Analysis of recursive state machines","volume":"27","author":"Alur","year":"2005","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0020","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/503502.503503","article-title":"Model checking of hierarchical state machines","volume":"23","author":"Alur","year":"2001","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"issue":"1","key":"10.1016\/j.jcss.2011.05.006_br0030","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","article-title":"A very hard log-space counting class","volume":"107","author":"\u00c0lvarez","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2011.05.006_br0040","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01200056","article-title":"Non-deterministic exponential time has two-prover interactive protocols","volume":"1","author":"Babai","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/j.jcss.2011.05.006_br0050","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/j.jcss.2011.05.006_br0060","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0020-0190(96)00096-8","article-title":"Succinct circuit representations and leaf language classes are basically the same concept","volume":"59","author":"Borchert","year":"1996","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/j.jcss.2011.05.006_br0070","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/j.jcss.2011.05.006_br0080","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","article-title":"A uniform method for proving lower bounds on the computational complexity of logical theories","volume":"48","author":"Compton","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.jcss.2011.05.006_br0090","series-title":"Handbook of Theoretical Computer Science, vol. B","first-page":"193","article-title":"Graph rewriting: An algebraic and logic approach","author":"Courcelle","year":"1990"},{"key":"10.1016\/j.jcss.2011.05.006_br0100","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.jcss.2011.05.006_br0110","series-title":"Finite Model Theory","author":"Ebbinghaus","year":"1991"},{"key":"10.1016\/j.jcss.2011.05.006_br0120","series-title":"Handbook of Formal Languages, vol. 3: Beyond Words","first-page":"125","article-title":"Context-free graph grammars","author":"Engelfriet","year":"1997"},{"key":"10.1016\/j.jcss.2011.05.006_br0130","series-title":"Complexity and Computation, SIAM\u2013AMS Proceedings, vol. 7","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","author":"Fagin","year":"1974"},{"key":"10.1016\/j.jcss.2011.05.006_br0140","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","article-title":"The first order properties of products of algebraic systems","volume":"47","author":"Feferman","year":"1959","journal-title":"Fund. Math."},{"key":"10.1016\/j.jcss.2011.05.006_br0150","article-title":"The complexity of problems on graphs represented as OBDDs","volume":"1999","author":"Feigenbaum","year":"1999","journal-title":"Chic. J. Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/j.jcss.2011.05.006_br0160","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/504794.504798","article-title":"Deciding first-order properties of locally tree-decomposable structures","volume":"48","author":"Frick","year":"2001","journal-title":"J. ACM"},{"issue":"1\u20133","key":"10.1016\/j.jcss.2011.05.006_br0170","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","article-title":"The complexity of first-order and monadic second-order logic revisited","volume":"130","author":"Frick","year":"2004","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.jcss.2011.05.006_br0180","series-title":"Logic Colloquium \u02bc81","first-page":"105","article-title":"On local and nonlocal properties","author":"Gaifman","year":"1982"},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0190","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","article-title":"Succinct representations of graphs","volume":"56","author":"Galperin","year":"1983","journal-title":"Information and Control"},{"key":"10.1016\/j.jcss.2011.05.006_br0200","series-title":"Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005)","first-page":"483","article-title":"Fixpoint logics on hierarchical structures","volume":"vol. 3821","author":"G\u00f6ller","year":"2005"},{"issue":"2","key":"10.1016\/j.jcss.2011.05.006_br0210","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/972639.972646","article-title":"Existential second-order logic over graphs: Charting the tractability frontier","volume":"51","author":"Gottlob","year":"2004","journal-title":"J. ACM"},{"issue":"1\u20133","key":"10.1016\/j.jcss.2011.05.006_br0220","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0168-0072(98)00057-8","article-title":"Succinctness as a source of complexity in logical formalisms","volume":"97","author":"Gottlob","year":"1999","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.jcss.2011.05.006_br0230","article-title":"Hyperedge Replacement: Grammars and Languages","volume":"vol. 643","author":"Habel","year":"1992"},{"issue":"5","key":"10.1016\/j.jcss.2011.05.006_br0240","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0250","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","article-title":"Expressibility and parallel complexity","volume":"18","author":"Immerman","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2011.05.006_br0260","series-title":"Descriptive Complexity","author":"Immerman","year":"1999"},{"issue":"4","key":"10.1016\/j.jcss.2011.05.006_br0270","first-page":"281","article-title":"Application of model theoretic games to discrete linear orders and finite automata","volume":"33","author":"Ladner","year":"1977","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0280","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1145\/65950.65952","article-title":"Hierarchical planarity testing algorithms","volume":"36","author":"Lengauer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/j.jcss.2011.05.006_br0290","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(92)90004-3","article-title":"The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems","volume":"44","author":"Lengauer","year":"1992","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"10.1016\/j.jcss.2011.05.006_br0300","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0217068","article-title":"Efficient solution of connectivity problems on hierarchically defined graphs","volume":"17","author":"Lengauer","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2011.05.006_br0310","series-title":"Elements of Finite Model Theory","author":"Libkin","year":"2004"},{"key":"10.1016\/j.jcss.2011.05.006_br0320","series-title":"Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005)","first-page":"168","article-title":"Model-checking hierarchical structures","author":"Lohrey","year":"2005"},{"key":"10.1016\/j.jcss.2011.05.006_br0330","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01786976","article-title":"Complexity classes and theories of finite models","volume":"15","author":"Lynch","year":"1982","journal-title":"Math. Systems Theory"},{"issue":"1\u20133","key":"10.1016\/j.jcss.2011.05.006_br0340","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","article-title":"Algorithmic aspects of the Feferman\u2013Vaught theorem","volume":"126","author":"Makowsky","year":"2004","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20133","key":"10.1016\/j.jcss.2011.05.006_br0350","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0168-0072(95)00013-5","article-title":"Arity and alternation in second-order logic","volume":"78","author":"Makowsky","year":"1996","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0360","first-page":"275","article-title":"The complexity of approximation PSPACE-complete problems for hierarchical specifications","volume":"1","author":"Marathe","year":"1994","journal-title":"Nordic J. Comput."},{"issue":"5","key":"10.1016\/j.jcss.2011.05.006_br0370","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1137\/S0097539795285254","article-title":"Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems","volume":"27","author":"Marathe","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"10.1016\/j.jcss.2011.05.006_br0380","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0304-3975(96)00008-4","article-title":"Hierarchically specified unit disk graphs","volume":"174","author":"Marathe","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2011.05.006_br0390","series-title":"Proceedings of the 14th International Conference on Concurrency Theory (CONCUR 2003)","first-page":"248","article-title":"Model checking a path","volume":"vol. 2761","author":"Markey","year":"2003"},{"key":"10.1016\/j.jcss.2011.05.006_br0400","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0410","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","article-title":"A note on succinct representations of graphs","volume":"71","author":"Papadimitriou","year":"1986","journal-title":"Information and Control"},{"issue":"2","key":"10.1016\/j.jcss.2011.05.006_br0420","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2011.05.006_br0430","series-title":"Modal and Temporal Properties of Processes","author":"Stirling","year":"2001"},{"issue":"1","key":"10.1016\/j.jcss.2011.05.006_br0440","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2011.05.006_br0450","series-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"Straubing","year":"1994"},{"issue":"3","key":"10.1016\/j.jcss.2011.05.006_br0460","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/j.jcss.2011.05.006_br0470","series-title":"Handbook of Formal Languages, vol. III","first-page":"389","article-title":"Languages, automata, and logic","author":"Thomas","year":"1997"},{"key":"10.1016\/j.jcss.2011.05.006_br0480","series-title":"Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982)","first-page":"137","article-title":"The complexity of relational query languages (extended abstract)","author":"Vardi","year":"1982"},{"key":"10.1016\/j.jcss.2011.05.006_br0490","series-title":"Proceedings of the Fourteenth ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems (PODS 1995)","first-page":"266","article-title":"On the complexity of bounded-variable queries","author":"Vardi","year":"1995"},{"issue":"5","key":"10.1016\/j.jcss.2011.05.006_br0500","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(97)00134-8","article-title":"Languages represented by Boolean formulas","volume":"63","author":"Veith","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.jcss.2011.05.006_br0510","series-title":"Proceedings of the 13th Annual IEEE Conference on Computational Complexity","first-page":"122","article-title":"How to encode a logical structure by an OBDD","author":"Veith","year":"1998"},{"issue":"2","key":"10.1016\/j.jcss.2011.05.006_br0520","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1006\/inco.1997.2696","article-title":"Succinct representation, leaf languages, and projection reductions","volume":"142","author":"Veith","year":"1998","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/j.jcss.2011.05.006_br0530","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1976","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0022000011000559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0022000011000559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:56:58Z","timestamp":1560214618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000011000559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["S0022000011000559"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.jcss.2011.05.006","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}