{"id":"https://openalex.org/W2971874129","doi":"https://doi.org/10.1007/978-3-030-30281-8_4","title":"A Modest Approach to Modelling and Checking Markov Automata","display_name":"A Modest Approach to Modelling and Checking Markov Automata","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2971874129","doi":"https://doi.org/10.1007/978-3-030-30281-8_4","mag":"2971874129"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-30281-8_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30281-8_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.22028/d291-48203","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005462869","display_name":"Yuliya Butkova","orcid":"https://orcid.org/0000-0002-9678-1467"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yuliya Butkova","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9678-1467","affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007673197","display_name":"Arnd Hartmanns","orcid":"https://orcid.org/0000-0003-3268-8674"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Arnd Hartmanns","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3268-8674","affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028747794","display_name":"Holger Hermanns","orcid":"https://orcid.org/0000-0002-2766-9615"},"institutions":[{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["CN","DE"],"is_corresponding":false,"raw_author_name":"Holger Hermanns","raw_affiliation_strings":["Institute of Intelligent Software, Guangzhou, China","Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2766-9615","affiliations":[{"raw_affiliation_string":"Institute of Intelligent Software, Guangzhou, China","institution_ids":["https://openalex.org/I4210128818"]},{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007673197"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":2.1908,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87823603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"69"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.992900013923645,"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"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.989799976348877,"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.7928038835525513},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6019335985183716},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5777052640914917},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5529320240020752},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5505193471908569},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.493857204914093},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.46548667550086975},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4639914035797119},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.453302264213562},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.44170641899108887},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.43393203616142273},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.41450995206832886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36793428659439087},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16345858573913574},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16287913918495178},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14262259006500244}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7928038835525513},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6019335985183716},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5777052640914917},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5529320240020752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5505193471908569},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.493857204914093},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.46548667550086975},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4639914035797119},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.453302264213562},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.44170641899108887},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.43393203616142273},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.41450995206832886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36793428659439087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16345858573913574},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16287913918495178},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14262259006500244},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-30281-8_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30281-8_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/f2759afa-0cee-4990-8a50-d6cbfa51705e","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/f2759afa-0cee-4990-8a50-d6cbfa51705e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.22028/d291-48203","is_oa":true,"landing_page_url":"https://doi.org/10.22028/d291-48203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Collection"}],"best_oa_location":{"id":"doi:10.22028/d291-48203","is_oa":true,"landing_page_url":"https://doi.org/10.22028/d291-48203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Collection"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G398350314","display_name":"Verification of Cyber-Physical Systems: Exploiting Uncertainty for Scalability","funder_award_id":"639.021.754","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W78405526","https://openalex.org/W275084143","https://openalex.org/W1499021164","https://openalex.org/W1504080271","https://openalex.org/W1515421972","https://openalex.org/W1556387789","https://openalex.org/W1874444266","https://openalex.org/W2020204292","https://openalex.org/W2071103858","https://openalex.org/W2087486424","https://openalex.org/W2096283629","https://openalex.org/W2110411539","https://openalex.org/W2111987809","https://openalex.org/W2119567691","https://openalex.org/W2163234015","https://openalex.org/W2172279531","https://openalex.org/W2243362255","https://openalex.org/W2262106677","https://openalex.org/W2334782222","https://openalex.org/W2488668998","https://openalex.org/W2568766587","https://openalex.org/W2584921486","https://openalex.org/W2593267253","https://openalex.org/W2598014203","https://openalex.org/W2598699400","https://openalex.org/W2609905251","https://openalex.org/W2735021239","https://openalex.org/W2788962669","https://openalex.org/W2797945469","https://openalex.org/W2803993242","https://openalex.org/W2809627970","https://openalex.org/W2883004055","https://openalex.org/W2898837242","https://openalex.org/W2925395957","https://openalex.org/W2926242892","https://openalex.org/W2932972683","https://openalex.org/W2964256340","https://openalex.org/W3099417312","https://openalex.org/W6910455413"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2288787028","https://openalex.org/W1597181838","https://openalex.org/W4214926706","https://openalex.org/W2612724135","https://openalex.org/W1655603041","https://openalex.org/W3149394920","https://openalex.org/W2037507558","https://openalex.org/W4300919771","https://openalex.org/W2146187895"],"abstract_inverted_index":{"Markov":[0,35,66,78,123],"automata":[1,36,67,79,124],"are":[2],"a":[3,57,107],"compositional":[4],"modelling":[5],"formalism":[6],"with":[7,44],"continuous":[8],"stochastic":[9],"time,":[10],"discrete":[11],"probabilities,":[12],"and":[13,26,33,68,88,103,120,130],"nondeterministic":[14],"choices.":[15],"In":[16],"this":[17],"paper,":[18],"we":[19],"present":[20],"extensions":[21],"to":[22,31,53,128],"the":[23,27,70,118],"Modest":[24,38],"language":[25,43],"mcsta":[28,102,116],"model":[29,125],"checker":[30],"describe":[32,93],"analyse":[34],"models.":[37],"is":[39],"an":[40],"expressive":[41],"high-level":[42],"roots":[45],"in":[46,56,101],"process":[47],"algebra":[48],"that":[49,115],"allows":[50],"large":[51],"models":[52,80],"be":[54],"specified":[55],"succinct,":[58],"modular":[59],"way.":[60],"We":[61,92],"explain":[62],"its":[63],"use":[64],"for":[65,84],"illustrate":[69],"advantages":[71],"over":[72],"alternative":[73,131],"languages.":[74],"The":[75],"verification":[76],"of":[77,110,122],"requires":[81],"dedicated":[82],"algorithms":[83,98],"time-bounded":[85],"probabilistic":[86],"reachability":[87],"long-run":[89],"average":[90],"rewards.":[91],"several":[94],"recently":[95],"developed":[96],"such":[97],"as":[99],"implemented":[100],"evaluate":[104],"them":[105],"on":[106],"comprehensive":[108],"set":[109],"benchmarks.":[111],"Our":[112],"evaluation":[113],"shows":[114],"improves":[117],"performance":[119],"scalability":[121],"checking":[126],"compared":[127],"earlier":[129],"tools.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}