{"id":"https://openalex.org/W2180888708","doi":"https://doi.org/10.1142/s0129054113400091","title":"PARAMETRIC VERIFICATION AND TEST COVERAGE FOR HYBRID AUTOMATA USING THE INVERSE METHOD","display_name":"PARAMETRIC VERIFICATION AND TEST COVERAGE FOR HYBRID AUTOMATA USING THE INVERSE METHOD","publication_year":2013,"publication_date":"2013-02-01","ids":{"openalex":"https://openalex.org/W2180888708","doi":"https://doi.org/10.1142/s0129054113400091","mag":"2180888708"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400091","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400091","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5058799763","display_name":"Laurent Fribourg","orcid":"https://orcid.org/0000-0002-5562-4078"},"institutions":[{"id":"https://openalex.org/I4210104198","display_name":"Laboratoire Sp\u00e9cification et V\u00e9rification","ror":"https://ror.org/01kz1bj67","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"LAURENT FRIBOURG","raw_affiliation_strings":["Laboratoire Specification et V\u00e9rification, CNRS &amp; ENS de Cachan, 61 avenue du Pr\u00e9sident Wilson, 94235 Cachan, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire Specification et V\u00e9rification, CNRS &amp; ENS de Cachan, 61 avenue du Pr\u00e9sident Wilson, 94235 Cachan, France","institution_ids":["https://openalex.org/I4210104198","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075576417","display_name":"Ulrich K\u00fchne","orcid":"https://orcid.org/0000-0002-0855-8223"},"institutions":[{"id":"https://openalex.org/I4210141311","display_name":"Staats- und Universit\u00e4tsbibliothek Bremen","ror":"https://ror.org/04cwb1p56","country_code":"DE","type":"archive","lineage":["https://openalex.org/I180437899","https://openalex.org/I4210141311"]},{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ULRICH K\u00dcHNE","raw_affiliation_strings":["Group for Computer Architecture, University of Bremen, Bibliothekstra\u00dfe 1, 28359 Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Group for Computer Architecture, University of Bremen, Bibliothekstra\u00dfe 1, 28359 Bremen, Germany","institution_ids":["https://openalex.org/I4210141311","https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058799763"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210104198"],"apc_list":null,"apc_paid":null,"fwci":2.9004,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91326901,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"02","first_page":"233","last_page":"249"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/hybrid-system","display_name":"Hybrid system","score":0.8221246004104614},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7399576902389526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6618611812591553},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.6480331420898438},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.6052680611610413},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5750343799591064},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.5381243228912354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4802156388759613},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.45695000886917114},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.42003774642944336},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.41860824823379517},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.41536980867385864},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4005512595176697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28662046790122986},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08557671308517456},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07630643248558044}],"concepts":[{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.8221246004104614},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7399576902389526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6618611812591553},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.6480331420898438},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.6052680611610413},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5750343799591064},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.5381243228912354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4802156388759613},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.45695000886917114},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.42003774642944336},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.41860824823379517},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.41536980867385864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4005512595176697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28662046790122986},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08557671308517456},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07630643248558044},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113400091","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400091","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2060095702","https://openalex.org/W2088667970","https://openalex.org/W2098166444","https://openalex.org/W2152533774"],"related_works":["https://openalex.org/W1927866400","https://openalex.org/W2109003011","https://openalex.org/W1903000972","https://openalex.org/W1504674997","https://openalex.org/W2189197255","https://openalex.org/W2049804310","https://openalex.org/W2901680979","https://openalex.org/W2107326133","https://openalex.org/W1803004510","https://openalex.org/W1518566078"],"abstract_inverted_index":{"Hybrid":[0,7],"systems":[1],"combine":[2],"continuous":[3],"and":[4,16,78],"discrete":[5],"behavior.":[6],"Automata":[8],"are":[9],"a":[10,37,44,48,51,86],"powerful":[11],"formalism":[12],"for":[13,56,60,73],"the":[14,29,68,91],"modeling":[15],"verification":[17,27],"of":[18,39,47,70],"such":[19],"systems.":[20],"A":[21],"common":[22],"problem":[23,59],"in":[24,35],"hybrid":[25,74,87],"system":[26,88],"is":[28,83],"good":[30],"parameters":[31],"problem,":[32],"which":[33,42],"consists":[34],"identifying":[36],"set":[38],"parameter":[40],"valuations":[41],"guarantee":[43],"certain":[45],"behavior":[46],"system.":[49],"Recently,":[50],"method":[52,82],"has":[53],"been":[54],"presented":[55],"attacking":[57],"this":[58,64,71],"Timed":[61],"Automata.":[62],"In":[63],"paper,":[65],"we":[66],"show":[67],"extension":[69],"methodology":[72],"automata":[75],"with":[76,85],"linear":[77],"affine":[79],"dynamics.":[80],"The":[81],"demonstrated":[84],"benchmark":[89],"from":[90],"literature.":[92]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
