{"id":"https://openalex.org/W2125708587","doi":"https://doi.org/10.1109/acc.2008.4586535","title":"Polynomial-time verification of the observer property in abstractions","display_name":"Polynomial-time verification of the observer property in abstractions","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2125708587","doi":"https://doi.org/10.1109/acc.2008.4586535","mag":"2125708587"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2008.4586535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2008.4586535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 American Control Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028968326","display_name":"Patr\u00edcia N. Pena","orcid":"https://orcid.org/0000-0002-7595-7814"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Patricia N. Pena","raw_affiliation_strings":["Department of Electronics Engineering (DELT), Federal University of Minas Gerais, Belo Horizonte, Minas Gerais, Brazil","Dept. of Electron. Eng. (DELT), Fed. Univ. of Minas Gerais, Belo Horizonte"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering (DELT), Federal University of Minas Gerais, Belo Horizonte, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I110200422"]},{"raw_affiliation_string":"Dept. of Electron. Eng. (DELT), Fed. Univ. of Minas Gerais, Belo Horizonte","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041838419","display_name":"Jos\u00e9 E.R. Cury","orcid":"https://orcid.org/0000-0001-7740-8539"},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jose E.R. Cury","raw_affiliation_strings":["Department of Automation and Systems (DAS), Federal University of Santa Catarina, Florianopolis, Santa Catarina, Brazil","Department of Automation and Systems (DAS), Federal University of Santa Catarina, Florianopolis, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation and Systems (DAS), Federal University of Santa Catarina, Florianopolis, Santa Catarina, Brazil","institution_ids":["https://openalex.org/I4104125"]},{"raw_affiliation_string":"Department of Automation and Systems (DAS), Federal University of Santa Catarina, Florianopolis, Brazil","institution_ids":["https://openalex.org/I4104125"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027585653","display_name":"St\u00e9phane Lafortune","orcid":"https://orcid.org/0000-0002-7526-6642"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephane Lafortune","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science (EECS), University of Michigan, Ann Arbor, MI, USA","Department of Electrical Engineering and Computer Science (EELS) - The University of Michigan, Ann Arbor, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science (EECS), University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science (EELS) - The University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0698,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87568242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"465","last_page":"470"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9998000264167786,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/reachability","display_name":"Reachability","score":0.7652897834777832},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6771636605262756},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.663343608379364},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.654934823513031},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6424872279167175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6103806495666504},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5024762153625488},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.48505204916000366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.484843373298645},{"id":"https://openalex.org/keywords/observer","display_name":"Observer (physics)","score":0.4734054505825043},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4732057452201843},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4710683226585388},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4563917815685272},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4536624550819397},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4468315541744232},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4284459054470062},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4272798001766205},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4254341125488281},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.42447957396507263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3263213038444519},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.16684076189994812},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14236703515052795},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.10590624809265137}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7652897834777832},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6771636605262756},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.663343608379364},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.654934823513031},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6424872279167175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6103806495666504},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5024762153625488},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.48505204916000366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.484843373298645},{"id":"https://openalex.org/C2780704645","wikidata":"https://www.wikidata.org/wiki/Q9251458","display_name":"Observer (physics)","level":2,"score":0.4734054505825043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4732057452201843},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4710683226585388},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4563917815685272},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4536624550819397},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4468315541744232},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4284459054470062},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4272798001766205},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4254341125488281},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.42447957396507263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3263213038444519},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.16684076189994812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14236703515052795},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.10590624809265137},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2008.4586535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2008.4586535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 American Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W101029079","https://openalex.org/W304710776","https://openalex.org/W1979349468","https://openalex.org/W2024016988","https://openalex.org/W2078233504","https://openalex.org/W2085128669","https://openalex.org/W2096911030","https://openalex.org/W2099157744","https://openalex.org/W2114254072","https://openalex.org/W2117558445","https://openalex.org/W2118725223","https://openalex.org/W2128572736","https://openalex.org/W2132862824","https://openalex.org/W2137510081","https://openalex.org/W2142324675","https://openalex.org/W2163277411","https://openalex.org/W2489145936"],"related_works":["https://openalex.org/W186350370","https://openalex.org/W2155870982","https://openalex.org/W2522171317","https://openalex.org/W2042728676","https://openalex.org/W1482505495","https://openalex.org/W2321527407","https://openalex.org/W2408583837","https://openalex.org/W3135656023","https://openalex.org/W3042269469","https://openalex.org/W1645283535"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,8],"algorithm":[4,69],"to":[5,20,32,40,86],"test":[6],"if":[7],"abstraction":[9],"obtained":[10],"through":[11],"natural":[12],"projection":[13,37],"has":[14],"the":[15,22,28,36,41,45,51,54,68,73,76,80,88],"observer":[16],"property,":[17],"without":[18],"having":[19],"compute":[21],"abstraction.":[23],"The":[24,65],"original":[25],"automaton":[26],"and":[27],"set":[29],"of":[30,53,59,61,67,75,79],"events":[31],"be":[33],"kept":[34],"by":[35],"are":[38,84],"inputs":[39],"algorithm.":[42,89],"An":[43],"automaton,":[44],"verifier,":[46],"is":[47,70],"built":[48],"such":[49],"that":[50],"verification":[52,58],"property":[55],"becomes":[56],"a":[57,62],"reachability":[60],"special":[63],"state.":[64],"complexity":[66],"polynomial":[71],"in":[72],"size":[74],"state":[77],"space":[78],"automaton.":[81],"Two":[82],"examples":[83],"presented":[85],"illustrate":[87]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}