{"id":"https://openalex.org/W138509690","doi":"https://doi.org/10.3217/jucs-014-12-1984","title":"Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking","display_name":"Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking","publication_year":2020,"publication_date":"2020-04-07","ids":{"openalex":"https://openalex.org/W138509690","doi":"https://doi.org/10.3217/jucs-014-12-1984","mag":"138509690"},"language":"en","primary_location":{"id":"doi:10.3217/jucs-014-12-1984","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-014-12-1984","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.3217/jucs-014-12-1984","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024736709","display_name":"Anatol Slissenko","orcid":null},"institutions":[{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anatol Slissenko","raw_affiliation_strings":["Paris 12 Val de Marne University"],"affiliations":[{"raw_affiliation_string":"Paris 12 Val de Marne University","institution_ids":["https://openalex.org/I197681013"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045640731","display_name":"Pavel Vasilyev","orcid":"https://orcid.org/0000-0002-1572-2298"},"institutions":[{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pavel Vasilyev","raw_affiliation_strings":["Paris 12 Val de Marne University"],"affiliations":[{"raw_affiliation_string":"Paris 12 Val de Marne University","institution_ids":["https://openalex.org/I197681013"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024736709"],"corresponding_institution_ids":["https://openalex.org/I197681013"],"apc_list":null,"apc_paid":null,"fwci":0.4331,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.66548055,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":null,"first_page":"1984","last_page":"2006"},"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.9962000250816345,"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.9940999746322632,"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/computer-science","display_name":"Computer science","score":0.8783696889877319},{"id":"https://openalex.org/keywords/abstract-state-machines","display_name":"Abstract state machines","score":0.6558725833892822},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5702465176582336},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.569438099861145},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.540084958076477},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5319728255271912},{"id":"https://openalex.org/keywords/predicate-logic","display_name":"Predicate logic","score":0.464277446269989},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.45505836606025696},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.453213632106781},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43401777744293213},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41946959495544434},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.41788196563720703},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.41270050406455994},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.36308255791664124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34903162717819214},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.11904788017272949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09564211964607239}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8783696889877319},{"id":"https://openalex.org/C145243422","wikidata":"https://www.wikidata.org/wiki/Q333385","display_name":"Abstract state machines","level":3,"score":0.6558725833892822},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5702465176582336},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.569438099861145},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.540084958076477},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5319728255271912},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.464277446269989},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.45505836606025696},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.453213632106781},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43401777744293213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41946959495544434},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.41788196563720703},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.41270050406455994},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.36308255791664124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34903162717819214},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.11904788017272949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09564211964607239},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3217/jucs-014-12-1984","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-014-12-1984","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:138509690","is_oa":false,"landing_page_url":"http://www.jucs.org/jucs_14_12/simulation_of_timed_abstract/jucs_14_12_1984_2006_slissenko.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S58563349","display_name":"JUCS - Journal of Universal Computer Science","issn_l":"0948-695X","issn":["0948-695X","0948-6968"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317875","host_organization_name":"Verlag der Technischen Universit\u00e4t Graz","host_organization_lineage":["https://openalex.org/P4310317875"],"host_organization_lineage_names":["Verlag der Technischen Universit\u00e4t Graz"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"JUCS - Journal of Universal Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.3217/jucs-014-12-1984","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-014-12-1984","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1532063552","https://openalex.org/W1552677332","https://openalex.org/W1574117976","https://openalex.org/W1626607324","https://openalex.org/W1853368733","https://openalex.org/W1980102547","https://openalex.org/W1998333922","https://openalex.org/W2043383965","https://openalex.org/W2051073429","https://openalex.org/W2286401665","https://openalex.org/W2292980398","https://openalex.org/W2792371739"],"related_works":["https://openalex.org/W1853368733","https://openalex.org/W2074794556","https://openalex.org/W1550995752","https://openalex.org/W2162032875","https://openalex.org/W2031124488","https://openalex.org/W1970083749","https://openalex.org/W2782719117","https://openalex.org/W1522276539","https://openalex.org/W1643848536","https://openalex.org/W2095281995","https://openalex.org/W1526491740","https://openalex.org/W2127365253","https://openalex.org/W1601091540","https://openalex.org/W2095929625","https://openalex.org/W1556900989","https://openalex.org/W1537902984","https://openalex.org/W1531296731","https://openalex.org/W1832926089","https://openalex.org/W2698891358","https://openalex.org/W2373389320"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,5,21,26,29],"prototype":[3],"of":[4,28],"simulator":[6,36],"for":[7],"reactive":[8],"timed":[9],"abstract":[10],"state":[11],"machines":[12],"(ASM)":[13],"that":[14],"checks":[15],"whether":[16],"the":[17,66],"generated":[18],"runs":[19],"verify":[20],"requirements":[22],"specification":[23],"represented":[24],"as":[25],"formula":[27],"First":[30],"Order":[31],"Timed":[32],"Logic":[33],"(FOTL).":[34],"The":[35,45],"deals":[37],"with":[38,40,57,63],"ASM":[39],"continuous":[41],"or":[42],"discrete":[43],"time.":[44],"time":[46],"constraints":[47],"are":[48],"linear":[49],"inequalities.":[50],"It":[51],"can":[52],"treat":[53],"two":[54],"semantics,":[55],"one":[56,62],"instantaneous":[58],"actions":[59],"and":[60,70],"another":[61],"delayed":[64],"actions,":[65],"delays":[67],"being":[68],"bounded":[69],"non-deterministic.":[71]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}