{"id":"https://openalex.org/W4399730642","doi":"https://doi.org/10.31274/td-20240617-50","title":"Formal specifications for cyber-physical systems","display_name":"Formal specifications for cyber-physical systems","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4399730642","doi":"https://doi.org/10.31274/td-20240617-50"},"language":"en","primary_location":{"id":"doi:10.31274/td-20240617-50","is_oa":false,"landing_page_url":"http://dx.doi.org/10.31274/td-20240617-50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Iowa State University","raw_type":"dissertation"},"type":"dissertation","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/A5000125668","display_name":"Gokul Hariharan","orcid":"https://orcid.org/0000-0002-3447-2183"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gokul Hariharan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5000125668"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.996999979019165,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.994700014591217,"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/computer-science","display_name":"Computer science","score":0.6981875896453857},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6058183908462524},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5589748024940491},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5430369973182678},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5015847682952881},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.48091694712638855},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4691666066646576},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4483628273010254},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.44496750831604004},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.43682217597961426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39358827471733093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3062054514884949},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.25434017181396484}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6981875896453857},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6058183908462524},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5589748024940491},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5430369973182678},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5015847682952881},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.48091694712638855},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4691666066646576},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4483628273010254},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.44496750831604004},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.43682217597961426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39358827471733093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3062054514884949},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.25434017181396484}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.31274/td-20240617-50","is_oa":false,"landing_page_url":"http://dx.doi.org/10.31274/td-20240617-50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Iowa State University","raw_type":"dissertation"},{"id":"pmh:oai:dr.lib.iastate.edu:20.500.12876/WwPgm8kz","is_oa":false,"landing_page_url":"https://doi.org/10.31274/td-20240617-50","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dissertation"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W1913543287","https://openalex.org/W2336941104","https://openalex.org/W3120153087"],"abstract_inverted_index":{"Formal":[0],"methods":[1,28],"are":[2,91,126,223,292],"used":[3],"extensively":[4],"in":[5,171],"software":[6,20],"and":[7,17,55,71,80,86,103,120,129,155,162,177,216,239,320,363,367],"hardware":[8,174],"verification,":[9,12],"quantum":[10],"system":[11,108],"ensuring":[13],"autonomous":[14],"vehicle":[15],"safety,":[16],"protecting":[18],"security-critical":[19],"from":[21,314],"threats.":[22],"However,":[23],"the":[24,32,69,116,143,151,159,168,185,200,203,247,260,277,299,311,324,339,342],"validity":[25],"of":[26,34,74,107,118,189,195,202,263,279,317],"formal":[27],"critically":[29],"depends":[30],"on":[31,158,368],"correctness":[33],"specifications.":[35,191,281],"This":[36],"thesis":[37],"contributes":[38],"to":[39,52,82,123,131,236,245,267,276,309,332,338,356],"(a)":[40],"developing":[41],"a":[42,100,193,229,274,315,328],"new":[43,230],"specification":[44,77,84,101],"language,":[45],"Mission-time":[46],"Linear":[47],"Temporal":[48],"Logic":[49],"Multi-type":[50],"(MLTLM),":[51],"ease":[53],"writing":[54],"verifying":[56],"specifications":[57,109,157,284],"that":[58,90,110,125,167,206,222,232,253],"involve":[59,111],"multiple":[60],"types,":[61],"e.g.,":[62],"different":[63,112],"time":[64],"scales,":[65],"(b)":[66],"solving":[67,183],"for":[68,184,199,213,294,334],"satisfiability":[70,73,187,255],"maximum":[72,186],"two":[75,357],"popular":[76,144],"languages,":[78],"MLTL":[79,124,146,153,161,190,248,254,283],"LTL":[81,280,318,335,351],"aid":[83],"debugging":[85],"optimally":[87],"design":[88,359],"systems":[89,221],"safe":[92,224],"by":[93,225],"construction.":[94,226],"Chapter":[95,180,271],"2":[96],"introduces":[97],"MLTLM":[98,119,137,156,163],"as":[99],"language":[102],"provides":[104,273],"many":[105],"examples":[106],"types.":[113],"We":[114,227,304],"prove":[115],"succinctness":[117],"develop":[121,228],"translations":[122,154,235,262,291],"minimally":[127],"succinct":[128],"equivalent":[130,286],"MLTL.":[132],"Lastly,":[133],"we":[134,297,322],"integrate":[135],"an":[136,306],"runtime":[138],"verification":[139,178],"(RV)":[140],"monitor":[141],"into":[142],"R2U2":[145],"RV":[147,164],"monitor.":[148],"Comparisons":[149],"between":[150],"optimal":[152],"native":[160],"monitors":[165],"suggest":[166],"latter":[169],"results":[170],"substantially":[172],"lower":[173],"resource":[175],"usage":[176],"times.":[179],"3":[181],"explores":[182],"(MaxSAT)":[188],"Given":[192],"set":[194,316],"specifications,":[196],"MaxSAT":[197,210,243,249,278,330,352],"solves":[198],"subset":[201],"largest":[204],"cardinality":[205],"is":[207,211,257,354],"simultaneously":[208],"satisfiable.":[209],"important":[212],"feature":[214,344],"prioritization":[215],"cost":[217],"analysis":[218],"while":[219],"designing":[220],"algorithm":[231,308,331],"does":[233],"fast":[234],"Boolean":[237,242,261,287,329],"logic,":[238],"use":[240,323],"off-the-shelf":[241],"solvers":[244],"solve":[246,333],"problem.":[250],"Results":[251],"show":[252],"checking":[256],"faster":[258],"using":[259,301],"this":[264],"work":[265],"compared":[266],"other":[268],"recent":[269],"approaches.":[270],"4":[272],"solution":[275],"Whereas":[282],"have":[285],"logic":[288],"formulas,":[289],"such":[290],"unavailable":[293],"LTL.":[295],"Hence,":[296],"approach":[298],"problem":[300],"core-based":[302],"techniques.":[303],"modify":[305],"existing":[307],"extract":[310],"unsatisfiable":[312,325],"core":[313,326],"formulas":[319],"then":[321],"with":[327],"MaxSAT.":[336],"Compared":[337],"original":[340],"algorithm,":[341],"core-extraction":[343],"has":[345],"minimal":[346],"overhead":[347],"($\\mathcal":[348],"O(1)$).":[349],"The":[350],"solver":[353],"applied":[355],"real":[358],"instances:":[360],"robot":[361],"navigation":[362],"power":[364],"load":[365],"distribution,":[366],"randomly":[369],"generated":[370],"instances.":[371]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}