{"id":"https://openalex.org/W4236241665","doi":"https://doi.org/10.1109/lics.2004.1319595","title":"Model checking synchronized products of infinite transition systems","display_name":"Model checking synchronized products of infinite transition systems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4236241665","doi":"https://doi.org/10.1109/lics.2004.1319595"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","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/A5085550560","display_name":"S. Wohrle","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"S. Wohrle","raw_affiliation_strings":["Lehrstuhl f\u00fcr Informatik 7, RWTH, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Informatik 7, RWTH, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002259199","display_name":"W. Thomas","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Thomas","raw_affiliation_strings":["Lehrstuhl f\u00fcr Informatik 7, RWTH, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Informatik 7, RWTH, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085550560"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.6743,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.73711399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"126","issue":null,"first_page":"2","last_page":"11"},"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.9966999888420105,"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/T11567","display_name":"semigroups and automata theory","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8639278411865234},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8369812965393066},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.8079201579093933},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7081973552703857},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.7021693587303162},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.6400170922279358},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5707472562789917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5122532248497009},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4919309616088867},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4783582091331482},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.4643018841743469},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.4570683240890503},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.44030308723449707},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.4247552156448364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4245014488697052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4007411301136017},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.313212126493454},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.1454831063747406},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14442330598831177},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1147761344909668}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8639278411865234},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8369812965393066},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.8079201579093933},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7081973552703857},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7021693587303162},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.6400170922279358},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5707472562789917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5122532248497009},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4919309616088867},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4783582091331482},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4643018841743469},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.4570683240890503},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.44030308723449707},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.4247552156448364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4245014488697052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4007411301136017},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.313212126493454},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.1454831063747406},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14442330598831177},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1147761344909668},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2004.1319595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","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":26,"referenced_works":["https://openalex.org/W67269200","https://openalex.org/W178638537","https://openalex.org/W1503624973","https://openalex.org/W1511526676","https://openalex.org/W1513341013","https://openalex.org/W1517623691","https://openalex.org/W1572832005","https://openalex.org/W1576712931","https://openalex.org/W1804800800","https://openalex.org/W1816620374","https://openalex.org/W1876811344","https://openalex.org/W1971416129","https://openalex.org/W1993883805","https://openalex.org/W2062792526","https://openalex.org/W2085467680","https://openalex.org/W2155343741","https://openalex.org/W2176814623","https://openalex.org/W2180386432","https://openalex.org/W2951026534","https://openalex.org/W4211008702","https://openalex.org/W4213231691","https://openalex.org/W4244088669","https://openalex.org/W4298237022","https://openalex.org/W4302339081","https://openalex.org/W6630963724","https://openalex.org/W6633891326"],"related_works":["https://openalex.org/W2009098458","https://openalex.org/W2619879631","https://openalex.org/W2067838189","https://openalex.org/W4248488207","https://openalex.org/W1980634162","https://openalex.org/W1997217819","https://openalex.org/W2995528133","https://openalex.org/W3006496683","https://openalex.org/W1567443981","https://openalex.org/W2561829717"],"abstract_inverted_index":{"Formal":[0],"verification":[1],"using":[2],"the":[3,23,33,88,99,106,111,123,142,145,156,160,177,200],"model-checking":[4],"paradigm":[5],"has":[6,26],"to":[7,27,31,105,181],"deal":[8],"with":[9,65,171],"two":[10],"aspects.":[11],"The":[12,38],"systems":[13,52,64,77],"models":[14],"are":[15,140],"structured,":[16],"often":[17],"as":[18],"products":[19,60],"of":[20,35,61,90,98,108,110,144,159,168],"components,":[21],"and":[22,85,184],"specification":[24],"logic":[25,93,161,170],"be":[28,47,103],"expressive":[29,157],"enough":[30],"allow":[32,129],"formalization":[34],"reachability":[36,96],"properties.":[37],"present":[39],"paper":[40],"is":[41,120,148,188],"a":[42,114,165],"study":[43],"on":[44],"what":[45],"can":[46,102],"achieved":[48],"for":[49,190,199],"infinite":[50,62,201],"transition":[51,63,73],"under":[53,162],"these":[54],"premises.":[55],"As":[56],"models,":[57],"we":[58,128,175],"consider":[59],"different":[66],"synchronization":[67],"constraints.":[68],"We":[69,153],"introduce":[70],"finitely":[71,81,195],"synchronized":[72,83],"systems,":[74],"i.e.":[75,132],"product":[76,100,146],"which":[78],"contain":[79],"only":[80],"many":[82,138],"transitions,":[84],"show":[86],"that":[87],"decidability":[89,107],"FO(R),":[91],"first-order":[92,169],"extended":[94],"by":[95],"predicates,":[97],"system":[101,147],"reduced":[104],"FO(R)":[109],"components":[112],"in":[113,122,134,149],"Feferman-Vaught":[115],"like":[116],"style.":[117],"This":[118],"result":[119],"optimal":[121],"following":[124],"sense.":[125],"(1)":[126],"If":[127],"semifinite":[130],"synchronization,":[131],"just":[133],"one":[135,183],"component":[136],"infinitely":[137],"transitions":[139],"synchronized,":[141],"FO(R)-theory":[143],"general":[150],"undecidable.":[151],"(2)":[152],"cannot":[154],"extend":[155],"power":[158],"consideration.":[163],"Already":[164],"weak":[166],"extension":[167],"transitive":[172,178],"closure,":[173],"where":[174],"restrict":[176],"closure":[179],"operators":[180],"arity":[182],"nesting":[185],"depth":[186],"two,":[187],"undecidable":[189],"an":[191],"asynchronous":[192],"(and":[193],"hence":[194],"synchronized)":[196],"product,":[197],"namely":[198],"grid.":[202]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}