{"id":"https://openalex.org/W2050383062","doi":"https://doi.org/10.1137/050645178","title":"Convex Programs for Temporal Verification of Nonlinear Dynamical Systems","display_name":"Convex Programs for Temporal Verification of Nonlinear Dynamical Systems","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2050383062","doi":"https://doi.org/10.1137/050645178","mag":"2050383062"},"language":"en","primary_location":{"id":"doi:10.1137/050645178","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050645178","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Control and Optimization","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/A5022400557","display_name":"S. Prajna","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen Prajna","raw_affiliation_strings":["California  Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California  Institute of Technology","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091667471","display_name":"Anders Rantzer","orcid":"https://orcid.org/0000-0001-7118-2786"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anders Rantzer","raw_affiliation_strings":["Department of Automatic Control"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automatic Control","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2448,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.87615875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"46","issue":"3","first_page":"999","last_page":"1021"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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.9990000128746033,"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/T13295","display_name":"Safety Systems Engineering in Autonomy","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11357","display_name":"Risk and Safety Analysis","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8147903680801392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.582845151424408},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.5661745667457581},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5477012395858765},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4867682456970215},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.460595965385437},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.41796454787254333},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.41445255279541016},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4140239953994751},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.39218294620513916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3414085805416107},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.284258097410202},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.22847741842269897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21154704689979553},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1537974774837494}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8147903680801392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.582845151424408},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.5661745667457581},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5477012395858765},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4867682456970215},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.460595965385437},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.41796454787254333},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.41445255279541016},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4140239953994751},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39218294620513916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3414085805416107},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.284258097410202},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.22847741842269897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21154704689979553},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1537974774837494},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/050645178","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050645178","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Control and Optimization","raw_type":"journal-article"},{"id":"pmh:oai:authors.library.caltech.edu:9034","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:PRAsiamjco07","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.324.1709","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.1709","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://authors.library.caltech.edu/9034/1/PRAsiamjco07.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:0ae78723-21ea-4ad8-baeb-f1caa77dc670","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/656877","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1095-7138","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W120333500","https://openalex.org/W1530240157","https://openalex.org/W1534416612","https://openalex.org/W1540180001","https://openalex.org/W1540897666","https://openalex.org/W1563147540","https://openalex.org/W1568518466","https://openalex.org/W1569146343","https://openalex.org/W1582811927","https://openalex.org/W1679534293","https://openalex.org/W1726255445","https://openalex.org/W1729334489","https://openalex.org/W1897764801","https://openalex.org/W1994475353","https://openalex.org/W2033118636","https://openalex.org/W2045938917","https://openalex.org/W2053913299","https://openalex.org/W2099354898","https://openalex.org/W2099687889","https://openalex.org/W2102696258","https://openalex.org/W2106850246","https://openalex.org/W2126749600","https://openalex.org/W2131441094","https://openalex.org/W2133404041","https://openalex.org/W2140464472","https://openalex.org/W2156301326","https://openalex.org/W2164989576","https://openalex.org/W2296319761","https://openalex.org/W2340735175","https://openalex.org/W2612952478","https://openalex.org/W2913459036","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2043642089","https://openalex.org/W2114397143","https://openalex.org/W4324118942","https://openalex.org/W1915031411","https://openalex.org/W2734993473","https://openalex.org/W2913057782","https://openalex.org/W2185064329","https://openalex.org/W2187229407","https://openalex.org/W2000285254","https://openalex.org/W2059909660"],"abstract_inverted_index":{"A":[0],"methodology":[1],"for":[2,124,169],"safety":[3,41,126,170],"verification":[4,171],"of":[5,36,55,66,77,111,152,161],"continuous":[6,112],"and":[7,33,127,139],"hybrid":[8],"systems":[9,113],"using":[10,172],"barrier":[11,24,173],"certificates":[12],"has":[13],"been":[14],"proposed":[15,154],"recently.":[16],"Conditions":[17],"that":[18,45,58,85,109],"must":[19],"be":[20,27,116],"satisfied":[21],"by":[22],"a":[23,30,52,60,78,166],"certificate":[25],"can":[26,114],"formulated":[28],"as":[29,129,131,136],"convex":[31,119,122],"program,":[32],"the":[34,37,43,70,75,82,93,99,150,153,159],"feasibility":[35],"program":[38],"implies":[39],"system":[40],"in":[42,98,106],"sense":[44],"there":[46],"is":[47],"no":[48],"trajectory":[49,79],"starting":[50,80],"from":[51,81,92],"given":[53,61,88],"set":[54,84],"initial":[56,83],"states":[57],"reaches":[59,86],"unsafe":[62],"region.":[63],"The":[64],"dual":[65],"this":[67,107],"problem,":[68,72,103],"i.e.,":[69],"reachability":[71,110],"concerns":[73],"proving":[74],"existence":[76],"another":[87],"set.":[89],"Using":[90],"insights":[91],"linear":[94],"programming":[95],"duality":[96],"appearing":[97],"discrete":[100],"shortest":[101],"path":[102],"we":[104,157],"show":[105],"paper":[108],"also":[115],"verified":[117],"through":[118],"programming.":[120],"Several":[121],"programs":[123],"verifying":[125],"reachability,":[128],"well":[130],"other":[132],"temporal":[133],"properties":[134],"such":[135],"eventuality,":[137],"avoidance,":[138],"their":[140],"combinations,":[141],"are":[142,146],"formulated.":[143],"Some":[144],"examples":[145],"provided":[147],"to":[148,164],"illustrate":[149],"application":[151],"methods.":[155],"Finally,":[156],"exploit":[158],"convexity":[160],"our":[162],"methods":[163],"derive":[165],"converse":[167],"theorem":[168],"certificates.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}