{"id":"https://openalex.org/W2112884098","doi":"https://doi.org/10.1109/memcod.2005.1487911","title":"Refinemant verification of fair transition systems can contribute to PLTL model checking","display_name":"Refinemant verification of fair transition systems can contribute to PLTL model checking","publication_year":2005,"publication_date":"2005-07-27","ids":{"openalex":"https://openalex.org/W2112884098","doi":"https://doi.org/10.1109/memcod.2005.1487911","mag":"2112884098"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2005.1487911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2005.1487911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.","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/A5078713499","display_name":"Fran\u00e7oise Bellegarde","orcid":null},"institutions":[{"id":"https://openalex.org/I90843659","display_name":"Universit\u00e9 de franche-comt\u00e9","ror":"https://ror.org/03pcc9z86","country_code":"FR","type":"education","lineage":["https://openalex.org/I90843659"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"F. Bellegarde","raw_affiliation_strings":["Laboratorie d' Informatique, Universit\u00e9 de Franche-Comte, Besancon, France"],"affiliations":[{"raw_affiliation_string":"Laboratorie d' Informatique, Universit\u00e9 de Franche-Comte, Besancon, France","institution_ids":["https://openalex.org/I90843659"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030673446","display_name":"Samir Chouali","orcid":"https://orcid.org/0000-0001-7985-4364"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S. Chouali","raw_affiliation_strings":["Laboratoire d' Informatique LORIA UMR 7503, Universit\u00e9 de Nancy, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d' Informatique LORIA UMR 7503, Universit\u00e9 de Nancy, France","institution_ids":["https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088104020","display_name":"Jacques Julliand","orcid":null},"institutions":[{"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"]},{"id":"https://openalex.org/I90843659","display_name":"Universit\u00e9 de franche-comt\u00e9","ror":"https://ror.org/03pcc9z86","country_code":"FR","type":"education","lineage":["https://openalex.org/I90843659"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J. Julliand","raw_affiliation_strings":["Laboratorie d' Informatique,FRS CNRS 2661, Universit\u00e9 de Franche-Comte, Besancon, France"],"affiliations":[{"raw_affiliation_string":"Laboratorie d' Informatique,FRS CNRS 2661, Universit\u00e9 de Franche-Comte, Besancon, France","institution_ids":["https://openalex.org/I90843659","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078713499"],"corresponding_institution_ids":["https://openalex.org/I90843659"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17603372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1243","issue":null,"first_page":"166","last_page":"175"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9768000245094299,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9749000072479248,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7912087440490723},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.707850992679596},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5463349223136902},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4762325882911682},{"id":"https://openalex.org/keywords/verification","display_name":"Verification","score":0.47185468673706055},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.43881478905677795},{"id":"https://openalex.org/keywords/runtime-verification","display_name":"Runtime verification","score":0.41502735018730164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34516215324401855},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31171756982803345},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.12103518843650818},{"id":"https://openalex.org/keywords/software-system","display_name":"Software system","score":0.09008002281188965}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7912087440490723},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.707850992679596},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5463349223136902},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4762325882911682},{"id":"https://openalex.org/C142284323","wikidata":"https://www.wikidata.org/wiki/Q7921323","display_name":"Verification","level":5,"score":0.47185468673706055},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.43881478905677795},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.41502735018730164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34516215324401855},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31171756982803345},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.12103518843650818},{"id":"https://openalex.org/C149091818","wikidata":"https://www.wikidata.org/wiki/Q2429814","display_name":"Software system","level":3,"score":0.09008002281188965},{"id":"https://openalex.org/C186846655","wikidata":"https://www.wikidata.org/wiki/Q3398377","display_name":"Software construction","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2005.1487911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2005.1487911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W120333500","https://openalex.org/W143291542","https://openalex.org/W1493466221","https://openalex.org/W1506588809","https://openalex.org/W1516806823","https://openalex.org/W1528291435","https://openalex.org/W1541059630","https://openalex.org/W1548402307","https://openalex.org/W1575221187","https://openalex.org/W1607782211","https://openalex.org/W1654252768","https://openalex.org/W1965244712","https://openalex.org/W2003227046","https://openalex.org/W2009965218","https://openalex.org/W2015688007","https://openalex.org/W2020306722","https://openalex.org/W2024985777","https://openalex.org/W2025726943","https://openalex.org/W2080593426","https://openalex.org/W2089003125","https://openalex.org/W2118382442","https://openalex.org/W2164989576","https://openalex.org/W2617782556","https://openalex.org/W2915052813","https://openalex.org/W4254354208","https://openalex.org/W6630996812","https://openalex.org/W6631572934","https://openalex.org/W6632508901","https://openalex.org/W6632655502","https://openalex.org/W6634447350","https://openalex.org/W6636258220","https://openalex.org/W6672608052","https://openalex.org/W6758810377"],"related_works":["https://openalex.org/W2809618173","https://openalex.org/W3120172095","https://openalex.org/W4375857205","https://openalex.org/W2549863208","https://openalex.org/W2108860137","https://openalex.org/W3036403349","https://openalex.org/W2406499533","https://openalex.org/W2006962382","https://openalex.org/W2115488885","https://openalex.org/W4252734721"],"abstract_inverted_index":{"We":[0,46,114],"present":[1,115],"a":[2,30,48,68,95],"verification":[3,60,72,86,93,133],"approach":[4],"of":[5,50,61,73,94],"dynamic":[6],"properties":[7,75],"under":[8,53,76],"fairness":[9,44,54,77],"assumptions":[10,55,78],"by":[11,43],"PLTL":[12,96,121],"model":[13,122,127],"checking":[14,123],"over":[15],"finite":[16],"state":[17],"reactive":[18],"systems.":[19],"The":[20],"systems":[21],"that":[22,107],"we":[23],"want":[24],"to":[25,117,125],"verify":[26],"are":[27,108],"specified":[28],"through":[29],"top-down":[31],"refinement":[32,52,63,85,112,132],"process.":[33],"They":[34],"interact":[35],"with":[36],"an":[37],"environment,":[38],"which":[39,128],"is":[40],"described":[41],"partly":[42],"assumptions.":[45],"give":[47],"definition":[49],"the":[51,59,62,71,74,80,84,88,92,104,111,119,126,131],"and":[56],"show":[57],"how":[58,116],"can":[64,99],"be":[65,100],"used":[66],"as":[67],"preprocessor":[69],"for":[70],"at":[79],"refined":[81],"level.":[82],"Indeed,":[83],"distinguishes":[87],"fair":[89,105],"executions.":[90],"So,":[91],"property":[97],"P":[98],"model-checked":[101],"only":[102],"on":[103],"executions":[106],"noticed":[109],"during":[110],"verification.":[113],"adapt":[118],"standard":[120],"algorithm":[124],"results":[129],"from":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
