{"id":"https://openalex.org/W1689388462","doi":"https://doi.org/10.1007/978-3-642-30793-5_2","title":"A Small Model Theorem for Rectangular Hybrid Automata Networks","display_name":"A Small Model Theorem for Rectangular Hybrid Automata Networks","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1689388462","doi":"https://doi.org/10.1007/978-3-642-30793-5_2","mag":"1689388462"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-30793-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30793-5_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01528730","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067901159","display_name":"Taylor T. Johnson","orcid":"https://orcid.org/0000-0001-8021-9923"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Taylor T. Johnson","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA","Dept. of Electrical and Computer Engineering, University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085795401","display_name":"Sayan Mitra","orcid":"https://orcid.org/0000-0002-6672-8470"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sayan Mitra","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA","Dept. of Electrical and Computer Engineering, University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067901159"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1538,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.97345643,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7664017677307129},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7570688128471375},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.753972053527832},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7108006477355957},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.7025412321090698},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6571212410926819},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5963286757469177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5580633282661438},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5428192615509033},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.5309747457504272},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5134483575820923},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5019760131835938},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.47428351640701294},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.47327446937561035},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.462617427110672},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4351344108581543},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.42720723152160645},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4182118773460388},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38267141580581665},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.35108160972595215},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2799857556819916},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.17995700240135193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14584043622016907}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7664017677307129},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7570688128471375},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.753972053527832},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7108006477355957},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.7025412321090698},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6571212410926819},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5963286757469177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5580633282661438},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5428192615509033},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.5309747457504272},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5134483575820923},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5019760131835938},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.47428351640701294},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.47327446937561035},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.462617427110672},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4351344108581543},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.42720723152160645},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4182118773460388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38267141580581665},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.35108160972595215},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2799857556819916},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.17995700240135193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14584043622016907},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-30793-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30793-5_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.471.2033","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.2033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.taylortjohnson.com/research/johnson2012smt.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.887.3340","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.887.3340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Taylor_Johnson9/publication/235993428_A_Small_Model_Theorem_for_Rectangular_Hybrid_Automata_Networks/links/0a85e537ba8f6d7e84000000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.889.2825","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.889.2825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mitras.ece.illinois.edu/research/2012/johnson2012forte.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01528730v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01528730","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. pp.18-34, ⟨10.1007/978-3-642-30793-5_2⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01528730v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01528730","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. pp.18-34, ⟨10.1007/978-3-642-30793-5_2⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7799999713897705,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W89866905","https://openalex.org/W169720976","https://openalex.org/W1480909796","https://openalex.org/W1488858096","https://openalex.org/W1492141863","https://openalex.org/W1506481780","https://openalex.org/W1519878813","https://openalex.org/W1522448884","https://openalex.org/W1522694098","https://openalex.org/W1536511644","https://openalex.org/W1536946401","https://openalex.org/W1541228707","https://openalex.org/W1547454936","https://openalex.org/W1549008998","https://openalex.org/W1556566737","https://openalex.org/W1561112849","https://openalex.org/W1569203277","https://openalex.org/W1570699118","https://openalex.org/W1577182994","https://openalex.org/W1590730808","https://openalex.org/W1591445921","https://openalex.org/W1605302571","https://openalex.org/W1889756448","https://openalex.org/W1904803564","https://openalex.org/W1928310376","https://openalex.org/W1945848346","https://openalex.org/W1986706177","https://openalex.org/W1995691455","https://openalex.org/W2003796615","https://openalex.org/W2004463571","https://openalex.org/W2008237330","https://openalex.org/W2021255060","https://openalex.org/W2060095702","https://openalex.org/W2060284851","https://openalex.org/W2085838366","https://openalex.org/W2098784258","https://openalex.org/W2107872611","https://openalex.org/W2132638915","https://openalex.org/W2137351629","https://openalex.org/W2147269402","https://openalex.org/W2147340401","https://openalex.org/W2149660990","https://openalex.org/W2159181605","https://openalex.org/W2176215692","https://openalex.org/W2340735175","https://openalex.org/W2397752352","https://openalex.org/W2504209588","https://openalex.org/W2798401172","https://openalex.org/W2911432472","https://openalex.org/W2913459036","https://openalex.org/W4231228921"],"related_works":["https://openalex.org/W1533908838","https://openalex.org/W2317925005","https://openalex.org/W1524267824","https://openalex.org/W2145225595","https://openalex.org/W2119907432","https://openalex.org/W1643219878","https://openalex.org/W1905380539","https://openalex.org/W3082631170","https://openalex.org/W2109003011","https://openalex.org/W4231063068"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}