{"id":"https://openalex.org/W4243734625","doi":"https://doi.org/10.1017/s0021900200008858","title":"Rational Processes Related to Communicating Markov Processes","display_name":"Rational Processes Related to Communicating Markov Processes","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W4243734625","doi":"https://doi.org/10.1017/s0021900200008858"},"language":"en","primary_location":{"id":"doi:10.1017/s0021900200008858","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200008858","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40509C24A43736DFC35899D3AE86097C/S0021900200008858a.pdf/div-class-title-rational-processes-related-to-communicating-markov-processes-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40509C24A43736DFC35899D3AE86097C/S0021900200008858a.pdf/div-class-title-rational-processes-related-to-communicating-markov-processes-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022119933","display_name":"Peter Buchholz","orcid":"https://orcid.org/0000-0002-9966-7686"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Buchholz","raw_affiliation_strings":["TU Dortmund"],"affiliations":[{"raw_affiliation_string":"TU Dortmund","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058423790","display_name":"Mikl\u00f3s Telek","orcid":"https://orcid.org/0000-0001-9600-6084"},"institutions":[{"id":"https://openalex.org/I4210161853","display_name":"Budapest Institute","ror":"https://ror.org/050hvq478","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210161853"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Mikl\u00f3s Telek","raw_affiliation_strings":["Technical University of Budapest"],"affiliations":[{"raw_affiliation_string":"Technical University of Budapest","institution_ids":["https://openalex.org/I4210161853"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022119933","https://openalex.org/A5058423790"],"corresponding_institution_ids":["https://openalex.org/I200332995","https://openalex.org/I4210161853"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.58752532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"49","issue":"01","first_page":"40","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9952999949455261,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9821000099182129,"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/mathematics","display_name":"Mathematics","score":0.7701279520988464},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.6452412605285645},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6159332990646362},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.582429826259613},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5714597702026367},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.5183221101760864},{"id":"https://openalex.org/keywords/markov-kernel","display_name":"Markov kernel","score":0.5122067332267761},{"id":"https://openalex.org/keywords/markov-renewal-process","display_name":"Markov renewal process","score":0.479084312915802},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.47462284564971924},{"id":"https://openalex.org/keywords/time-reversibility","display_name":"Time reversibility","score":0.4291256368160248},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4284779131412506},{"id":"https://openalex.org/keywords/markov-property","display_name":"Markov property","score":0.4169422388076782},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41572511196136475},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.4025042653083801},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3691955804824829},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3691655993461609},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.30974751710891724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18220582604408264},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09760335087776184},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08368787169456482}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7701279520988464},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.6452412605285645},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6159332990646362},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.582429826259613},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5714597702026367},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.5183221101760864},{"id":"https://openalex.org/C106666656","wikidata":"https://www.wikidata.org/wiki/Q6771323","display_name":"Markov kernel","level":5,"score":0.5122067332267761},{"id":"https://openalex.org/C163540672","wikidata":"https://www.wikidata.org/wiki/Q1115431","display_name":"Markov renewal process","level":5,"score":0.479084312915802},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.47462284564971924},{"id":"https://openalex.org/C98735484","wikidata":"https://www.wikidata.org/wiki/Q186971","display_name":"Time reversibility","level":5,"score":0.4291256368160248},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4284779131412506},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.4169422388076782},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41572511196136475},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.4025042653083801},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3691955804824829},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3691655993461609},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.30974751710891724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18220582604408264},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09760335087776184},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08368787169456482},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0021900200008858","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200008858","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40509C24A43736DFC35899D3AE86097C/S0021900200008858a.pdf/div-class-title-rational-processes-related-to-communicating-markov-processes-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0021900200008858","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200008858","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40509C24A43736DFC35899D3AE86097C/S0021900200008858a.pdf/div-class-title-rational-processes-related-to-communicating-markov-processes-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4243734625.pdf","grobid_xml":"https://content.openalex.org/works/W4243734625.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W45613378","https://openalex.org/W1518617173","https://openalex.org/W1974090207","https://openalex.org/W1980516607","https://openalex.org/W2018816667","https://openalex.org/W2019239197","https://openalex.org/W2019618652","https://openalex.org/W2049193516","https://openalex.org/W2070482505","https://openalex.org/W2075690166","https://openalex.org/W2084876786","https://openalex.org/W2101969505","https://openalex.org/W2109161029","https://openalex.org/W2113763958","https://openalex.org/W2114710208","https://openalex.org/W2143002993","https://openalex.org/W2146380521","https://openalex.org/W2152719753"],"related_works":["https://openalex.org/W2019735591","https://openalex.org/W2053574276","https://openalex.org/W4242346390","https://openalex.org/W4249175968","https://openalex.org/W2050665677","https://openalex.org/W2024318042","https://openalex.org/W3130462525","https://openalex.org/W3022014775","https://openalex.org/W2081606708","https://openalex.org/W1534371740"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,33,77,84],"class":[3],"of":[4,18,35,59,96,131,145],"stochastic":[5],"processes,":[6],"denoted":[7],"as":[8],"marked":[9],"rational":[10,23,79],"arrival":[11,24],"processes":[12,28,45,109],"(MRAPs),":[13],"which":[14],"is":[15,50,81,124,140],"an":[16],"extension":[17],"matrix":[19],"exponential":[20],"distributions":[21],"and":[22,48,61,64,110,121,147],"processes.":[25,75,133],"Continuous-time":[26],"Markov":[27,74,85,98,108],"with":[29],"labeled":[30],"transitions":[31],"are":[32,46,56,116],"subclass":[34],"this":[36],"more":[37,117],"general":[38,78,118],"model":[39],"class.":[40],"New":[41],"equivalence":[42,54,114,139],"relations":[43,55,68,115],"between":[44],"defined,":[47],"it":[49,87,123],"shown":[51],"that":[52,69,137],"these":[53],"natural":[57],"extensions":[58],"strong":[60],"weak":[62],"lumpability":[63,120],"the":[65,97,112,138,143],"corresponding":[66],"bisimulation":[67],"have":[70],"been":[71],"defined":[72],"for":[73],"If":[76],"process":[80],"equivalent":[82],"to":[83,104,127],"process,":[86],"can":[88,148],"be":[89,150],"used":[90],"in":[91,152],"numerical":[92],"analysis":[93],"techniques":[94],"instead":[95],"process.":[99],"This":[100],"observation":[101],"allows":[102],"one":[103],"apply":[105],"MRAPs":[106,146],"like":[107],"since":[111],"new":[113],"than":[119],"bisimulation,":[122],"sometimes":[125],"possible":[126],"find":[128],"smaller":[129],"representations":[130],"given":[132],"Finally,":[134],"we":[135],"show":[136],"preserved":[141],"by":[142],"composition":[144],"therefore":[149],"exploited":[151],"compositional":[153],"modeling.":[154]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}