{"id":"https://openalex.org/W2397752352","doi":"https://doi.org/10.29007/sc2w","title":"MCMT in the Land of Parametrized Timed Automata","display_name":"MCMT in the Land of Parametrized Timed Automata","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2397752352","doi":"https://doi.org/10.29007/sc2w","mag":"2397752352"},"language":"en","primary_location":{"id":"doi:10.29007/sc2w","is_oa":true,"landing_page_url":"https://doi.org/10.29007/sc2w","pdf_url":"https://easychair.org/publications/open/q9s","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/q9s","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044798564","display_name":"Alessandro Carioni","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessandro Carioni","raw_affiliation_strings":["DTI, Universit degli Studi di Milano (Italia), Silvio Ghilardi DSI, Universit degli Studi di Milano (Italia) and","Silvio Ranise FBK-Irst, Trento (Italia","DTI, Universit\u00e0 degli Studi di Milano (Italia), Silvio Ghilardi DSI, Universit\u00e0 degli Studi di Milano (Italia) and"],"affiliations":[{"raw_affiliation_string":"DTI, Universit degli Studi di Milano (Italia), Silvio Ghilardi DSI, Universit degli Studi di Milano (Italia) and","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"Silvio Ranise FBK-Irst, Trento (Italia","institution_ids":[]},{"raw_affiliation_string":"DTI, Universit\u00e0 degli Studi di Milano (Italia), Silvio Ghilardi DSI, Universit\u00e0 degli Studi di Milano (Italia) and","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041352997","display_name":"Silvio Ghilardi","orcid":"https://orcid.org/0000-0001-6449-6883"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silvio Ghilardi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047487115","display_name":"Silvio Ranise","orcid":"https://orcid.org/0000-0001-7269-9285"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silvio Ranise","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044798564"],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":0.2137,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.50969457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"47","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9923999905586243,"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/reachability","display_name":"Reachability","score":0.8733148574829102},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7422484159469604},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7248828411102295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6912519335746765},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6592870950698853},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6281969547271729},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5673825740814209},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5556949377059937},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5526134967803955},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5055198669433594},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4655495584011078},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.45129960775375366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4471186697483063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44407713413238525},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.43649864196777344},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.42240017652511597},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3495440185070038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2772631049156189},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09840822219848633}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8733148574829102},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7422484159469604},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7248828411102295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6912519335746765},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6592870950698853},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6281969547271729},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5673825740814209},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5556949377059937},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5526134967803955},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5055198669433594},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4655495584011078},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.45129960775375366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4471186697483063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44407713413238525},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.43649864196777344},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.42240017652511597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3495440185070038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2772631049156189},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09840822219848633}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/sc2w","is_oa":true,"landing_page_url":"https://doi.org/10.29007/sc2w","pdf_url":"https://easychair.org/publications/open/q9s","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/sc2w","is_oa":true,"landing_page_url":"https://doi.org/10.29007/sc2w","pdf_url":"https://easychair.org/publications/open/q9s","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2397752352.pdf","grobid_xml":"https://content.openalex.org/works/W2397752352.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W62756867","https://openalex.org/W1496749443","https://openalex.org/W1511903507","https://openalex.org/W1516900991","https://openalex.org/W1541228707","https://openalex.org/W1566982456","https://openalex.org/W1572952339","https://openalex.org/W1603554695","https://openalex.org/W2003796615","https://openalex.org/W2021255060","https://openalex.org/W2023499821","https://openalex.org/W2090286414","https://openalex.org/W2098784258","https://openalex.org/W2123910665","https://openalex.org/W2129073086","https://openalex.org/W2145736279","https://openalex.org/W2166752259","https://openalex.org/W2611515161","https://openalex.org/W3106753174","https://openalex.org/W4231228921","https://openalex.org/W6636096118","https://openalex.org/W6679324309"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W4379142300","https://openalex.org/W2091617677","https://openalex.org/W1945774704","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287"],"abstract_inverted_index":{"Timed":[0],"networks":[1,108],"are":[2,124],"parametrized":[3],"systems":[4,32,126,192],"of":[5,15,25,31,40,43,54,90,96,105,128,137,184,203,209,240],"timed":[6,107,148,174],"au\\-to\\-ma\\-ta.":[7],"Solving":[8],"reachability":[9,117,175],"problems":[10,56,176,223],"(e.g.,":[11],"whether":[12],"a":[13,115,145,186,207,235],"set":[14,24],"unsafe":[16],"states":[17],"can":[18,224],"ever":[19],"be":[20,225],"reached":[21],"from":[22],"the":[23,41,46,75,78,88,94,97,134,140,156,160,180,201,214],"initial":[26],"states)":[27],"for":[28,101,147,159,189,234],"this":[29,52,164],"class":[30],"allows":[33],"one":[34],"to":[35,87,93,154,169,179],"prove":[36],"safety":[37],"properties":[38],"regardless":[39],"number":[42,89,135,208,239],"processes":[44,91,138,241],"in":[45,50,139],"network.":[47,98],"The":[48],"difficulty":[49],"solving":[51,130],"kind":[53],"verification":[55],"is":[57,83,109,142,152],"two-fold.":[58],"First,":[59],"each":[60],"process":[61],"has":[62],"(at":[63],"least":[64],"one)":[65],"clock":[66],"variable":[67],"ranging":[68],"over":[69],"an":[70],"infinite":[71,190],"set,":[72],"such":[73,131,212],"as":[74,213],"reals":[76],"or":[77],"integers.":[79],"Second,":[80],"every":[81],"system":[82],"parameterized":[84,106],"with":[85],"respect":[86],"and":[92,144,173],"topology":[95],"Reachability":[99],"problem":[100],"some":[102],"restricted":[103],"classes":[104],"decidable":[110],"under":[111],"suitable":[112],"assumptions":[113],"by":[114,177,229,242],"backward":[116],"procedure.":[118],"Despite":[119],"these":[120],"theoretical":[121],"results,":[122],"there":[123],"few":[125],"capable":[127],"automatically":[129],"problems.":[132],"Instead,":[133],"$n$":[136],"network":[141],"fixed":[143,236],"tool":[146],"automata":[149],"(like":[150],"Uppaal)":[151],"used":[153],"check":[155],"desired":[157],"property":[158],"given":[161],"$n$.":[162],"In":[163],"paper,":[165],"we":[166],"explain":[167],"how":[168],"attack":[170],"fully":[171,221],"parameteric":[172],"translation":[178],"declarative":[181],"input":[182],"language":[183],"\\textsc{mcmt},":[185],"model":[187],"checker":[188],"state":[191],"based":[193],"on":[194,206],"Satisfiability":[195],"Modulo":[196],"Theories":[197],"techniques.":[198],"We":[199],"show":[200,219],"success":[202],"our":[204],"approach":[205],"standard":[210],"algorithms,":[211],"Fischer":[215],"protocol.":[216],"Preliminary":[217],"experiments":[218],"that":[220],"parametric":[222],"more":[226],"easily":[227],"solved":[228],"\\textsc{mcmt}":[230],"than":[231],"their":[232],"instances":[233],"(and":[237],"large)":[238],"other":[243],"systems.":[244]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}