{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:43:34Z","timestamp":1733982214596,"version":"3.30.2"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3546,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0304-3975(02)00894-0","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T17:20:43Z","timestamp":1046798443000},"page":"393-427","source":"Crossref","is-referenced-by-count":0,"title":["Categorical foundations for randomly timed automata"],"prefix":"10.1016","volume":"308","author":[{"given":"P.","family":"Mateus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Morais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Nunes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pacheco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sernadas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Sernadas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(02)00894-0_BIB1","first-page":"281","article-title":"Realization theory for automata in categories","volume":"9","author":"Ad\u00e1mek","year":"1976","journal-title":"J. Pure Appl. Algebra"},{"year":"1991","series-title":"Automata and Algebras in Categories","author":"Ad\u00e1mek","key":"10.1016\/S0304-3975(02)00894-0_BIB2"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB3","doi-asserted-by":"crossref","unstructured":"L. Alfaro, How to specify and verify the long-run average behavior of probabilistic systems, in: LICS 98: 13th Annu. IEEE Symp. on Logic in Computer Science, IEEE Press, New York, 1998, pp. 454\u2013465.","DOI":"10.1109\/LICS.1998.705679"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB4","series-title":"CONCUR\u201999: Concurrency Theory","first-page":"66","article-title":"Computing minimum and maximum reachability times in probabilistic systems","volume":"Vol. 1664","author":"Alfaro","year":"1999"},{"issue":"3","key":"10.1016\/S0304-3975(02)00894-0_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0022-4049(75)90028-6","article-title":"Adjoint machines, state-behaviour machines and duality","volume":"6","author":"Arbib","year":"1975","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0022-4049(80)90090-0","article-title":"Machines in a category","volume":"19","author":"Arbib","year":"1980","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"10.1016\/S0304-3975(02)00894-0_BIB7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0020-0190(98)00038-6","article-title":"On the verification of qualitative properties of probabilistic processes under fairness constraints","volume":"66","author":"Baier","year":"1998","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0304-3975(02)00894-0_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1142\/S0218126698000067","article-title":"Recent developments in non-Markovian stochastic Petri nets","volume":"8","author":"Bobbio","year":"1998","journal-title":"J. Systems Circuits Comput."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00894-0_BIB9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0304-3975(98)00169-8","article-title":"Exact performance equivalence: an equivalence relation for stochastic automata","volume":"215","author":"Buchholz","year":"1999","journal-title":"Theoret. Comput. Sci."},{"year":"1999","series-title":"Introduction to Discrete Event Systems","author":"Cassandras","key":"10.1016\/S0304-3975(02)00894-0_BIB10"},{"year":"1988","series-title":"An Introduction to the Theory of Point Processes","author":"Daley","key":"10.1016\/S0304-3975(02)00894-0_BIB11"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB12","doi-asserted-by":"crossref","unstructured":"F. Demichelis, W. Zielonka, Controlled timed automata, in: D. Sangiorgi, R. Simone (Eds.), CONCUR\u201998: Concurrency Theory, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 455\u2013469.","DOI":"10.1007\/BFb0055641"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB13","doi-asserted-by":"crossref","unstructured":"J. Desharnais, A. Edalat, P. Panangaden, A logic characterization of bisimulation for labeled Markov processes, in: LICS 98: 13th Ann. IEEE Symp. on Logic in Computer Science, IEEE Press, New York, 1998, pp. 478\u2013487.","DOI":"10.1109\/LICS.1998.705681"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB14","doi-asserted-by":"crossref","unstructured":"H. Ehrig, K. Kiermeier, H.-J. Kreowski, W. K\u00fchnel, Universal Theory of Automata\u2014A Categorical Approach, Teubner, Stuttgart, 1974.","DOI":"10.1007\/978-3-322-96644-5"},{"year":"2000","series-title":"Performance Analysis of Communication Systems, Modeling with Non-Markovian Stochastic Petri Nets","author":"German","key":"10.1016\/S0304-3975(02)00894-0_BIB15"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB16","doi-asserted-by":"crossref","unstructured":"R. German, A. Moorsel, M. Qureshi, W. Sanders, Expected impulse rewards in Markov regenerative stochastic Petri nets, in: Application and Theory of Petri nets 1996, Lecture Notes in Computer Science, Vol. 1091, Springer, Berlin, 1996, pp. 172\u2013191.","DOI":"10.1007\/3-540-61363-3_10"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB17","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1090\/S0002-9904-1972-13032-5","article-title":"Minimal realization of machines in closed categories","volume":"78","author":"Goguen","year":"1972","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01843493","article-title":"Realization is universal","volume":"6","author":"Goguen","year":"1972","journal-title":"Math. Systems Theory"},{"issue":"2","key":"10.1016\/S0304-3975(02)00894-0_BIB19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/inco.1994.1060","article-title":"Temporal proof methodologies for timed transition systems","volume":"112","author":"Henzinger","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB20","doi-asserted-by":"crossref","unstructured":"P. Katis, N. Sabadini, R.F.C. Walters, Representing place\/transition nets in span(graph), in: M. Johnson (Ed.), Proc. 6th AMAST Conf., Lecture Notes in Computer Science, Vol. 1349, Springer, Berlin, 1997, pp. 323\u2013336.","DOI":"10.1007\/BFb0000480"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB21","doi-asserted-by":"crossref","unstructured":"P. Katis, N. Sabadini, R.F.C. Walters, Span(graph): a categorical algebra of transition systems, in: M. Johnson (Ed.), Proc. Sixth AMAST Conf., Lecture Notes in Computer Science, Vol. 1349, Springer, Berlin, 1997, pp. 307\u2013322.","DOI":"10.1007\/BFb0000479"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00894-0_BIB22","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0304-3975(95)00004-G","article-title":"A decomposition theorem for probabilistic transition systems","volume":"145","author":"Maler","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB23","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/32.29483","article-title":"The effect of excecution policies on the semantics of stochastic Petri nets","volume":"15","author":"Marsan","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB24","unstructured":"P. Mateus, Interconnection of probabilistic systems, Ph.D. Thesis, IST, Universidade T\u00e9cnica de Lisboa, 2000, Supervised by A. Sernadas and C. Sernadas."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB25","doi-asserted-by":"crossref","unstructured":"P. Mateus, A. Sernadas, C. Sernadas, Precategories for combining probabilistic automata, Electronic Notes in Theoretical Computer Science, Vol. 29, 1999.","DOI":"10.1016\/S1571-0661(05)80315-9"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB26","doi-asserted-by":"crossref","unstructured":"P. Mateus, A. Sernadas, C. Sernadas. Realization of probabilistic automata: Categorical approach, in: Didier Bert, Christine Choppy (Eds.), Recent Trends in Algebraic Development Techniques\u2014Selected Papers, Lecture Notes in Computer Science, Vol. 1827, Springer, Berlin, 2000, pp. 237\u2013251.","DOI":"10.1007\/978-3-540-44616-3_14"},{"issue":"1","key":"10.1016\/S0304-3975(02)00894-0_BIB27","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1214\/aoap\/1034968066","article-title":"A Markovian storage model","volume":"6","author":"Pacheco","year":"1996","journal-title":"Ann. Appl. Probab."},{"year":"1994","series-title":"Theoretical Probability for Applications","author":"Port","key":"10.1016\/S0304-3975(02)00894-0_BIB28"},{"issue":"4","key":"10.1016\/S0304-3975(02)00894-0_BIB29","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1017\/S0960129502003614","article-title":"Universal aspects of probabilistic automata","volume":"12","author":"Schr\u00f6der","year":"2002","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB30","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s002360050141","article-title":"Denotational semantics of object specification","volume":"35","author":"Sernadas","year":"1998","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00894-0_BIB31","doi-asserted-by":"crossref","unstructured":"E. Stark, S. Smolka, Compositional analysis of expected delays in networks of probabilistic I\/O automata, in: LICS 98: 13th Ann. IEEE Symp. on Logic in Computer Science, IEEE Press, New York, 1998, pp. 466\u2013477.","DOI":"10.1109\/LICS.1998.705680"},{"key":"10.1016\/S0304-3975(02)00894-0_BIB32","doi-asserted-by":"crossref","unstructured":"G. Winskel, M. Nielsen, Models of concurrency, in: D. Gabbay S. Abramsky, T. Maibaum (Eds.), Handbook of Logic in Computer Science Vol. 4, Oxford Science Publications, Oxford, 1995, pp. 1\u2013148.","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00894-0_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00056-X","article-title":"Composition and behaviors of probabilistic I\/O automata","volume":"176","author":"Wu","year":"1997","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008940?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008940?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T16:57:55Z","timestamp":1733936275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0304397502008940"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00894-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}