{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:36Z","timestamp":1761611136847},"reference-count":19,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3742,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1571-0661(04)80520-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"65-84","source":"Crossref","is-referenced-by-count":14,"title":["Revisiting Interactive Markov Chains"],"prefix":"10.1016","volume":"68","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(04)80520-6_NEWBIB1","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1137\/S0097539793243600","article-title":"\u201cOn \u201cAxiomatising Finite Concurrent Processes\u201d \u201d","volume":"23","author":"Aceto","year":"1994","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB2","unstructured":"M. Bernardo, \u201cTheory and Application of Extended Markovian Process Algebra\u201d, Ph.D. Thesis, University of Bologna (Italy), 1999"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB3","doi-asserted-by":"crossref","unstructured":"M. Bravetti, \u201cSpecification and Analysis of Stochastic Real-Time Systems\u201d, Ph.D. Thesis, University of Bologna (Italy), 2002. Available at http:\/\/www.cs.unibo.it\/~bravetti","DOI":"10.1007\/3-540-45605-8_14"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB4","unstructured":"M. Bravetti, M. Bernardo, R. Gorrieri, \u201cA Note on the Congruence Proof for Recursion in Markovian Bisimulation Equivalence\u201d, in Proc. of the 6th Int. Workshop on Process Algebras and Performance Modeling (PAPM '98), C. Priami editor, pp. 153\u2013164, Nice (France), September 1998"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0304-3975(01)00043-3","article-title":"\u201cThe Theory of Interactive Generalized Semi-Markov Processes\u201d","volume":"282","author":"Bravetti","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB6","doi-asserted-by":"crossref","unstructured":"M. Bravetti, R. Gorrieri, \u201cA Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors\u201d, in Proc. of the 27th Int. Colloquium on Automata, Languages and Programming (ICALP 2000), U. Montanari, J.D.P. Rolim and E. Welzl ed., LNCS 1853: 744\u2013755, Geneva (Switzerland), 2000","DOI":"10.1007\/3-540-45022-X_62"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB7","series-title":"Handbook of Process Algebra","first-page":"711","article-title":"\u201cPriority in Process Algebras\u201d","author":"Cleaveland","year":"2001"},{"issue":"2","key":"10.1016\/S1571-0661(04)80520-6_NEWBIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","article-title":"\u201cA Process Algebra for Timed Systems\u201d","volume":"117","author":"Hennessy","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB9","unstructured":"H. Hermanns, \u201cInteractive Markov Chains\u201d, Ph.D. Thesis, Universit\u00e4t Erlangen-N\u00fcrnberg (Germany), 1998"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB10","series-title":"Proc. of the 5th Workshop on Process Algebras and Performance Modeling","first-page":"55","article-title":"\u201cAn Operator for Symmetry Representation and Exploitation in Stochastic Process Algebras\u201d","author":"Hermanns","year":"1997"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB11","doi-asserted-by":"crossref","unstructured":"H. Hermanns, M. Lohrey, \u201cPriority and Maximal Progress Are Completely Axiomatisable (Extended Abstract)\u201d, in Proc. of the 9th Int. Conf. on Concurrency Theory (CONCUR '98), LNCS 1466: 237\u2013252, Nice (France), 1998","DOI":"10.1007\/BFb0055626"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB12","series-title":"\u201cA Compositional Approach to Performance Modelling,\u201d","author":"Hillston","year":"1996"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB13","series-title":"\u201cCommunicating Sequential Processes,\u201d","author":"Hoare","year":"1985"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB14","series-title":"\u201cCommunication and Concurrency,\u201d","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"\u201cA Complete Inference System for a Class of Regular Behaviours\u201d","volume":"28","author":"Milner","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","article-title":"\u201cA Complete Axiomatization for Observational Congruence of Finite-state Behaviours\u201d","volume":"81","author":"Milner","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB17","series-title":"Real-Time: Theory in Practice","article-title":"\u201cAn Overview and Synthesis on Timed Process Algebras\u201d","author":"Nicollin","year":"1991"},{"issue":"6","key":"10.1016\/S1571-0661(04)80520-6_NEWBIB18","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/comjnl\/38.7.578","article-title":"\u201cStochastic \u03c0-Calculus\u201d","volume":"38","author":"Priami","year":"1995","journal-title":"Computer Journal"},{"key":"10.1016\/S1571-0661(04)80520-6_NEWBIB19","series-title":"\u201cIntroduction to the Numerical Solution of Markov Chains,\u201d","author":"Stewart","year":"1994"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:11:41Z","timestamp":1585897901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1571066104805206"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80520-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}