{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:04Z","timestamp":1761596704414},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00304-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:01:16Z","timestamp":1027627276000},"page":"379-422","source":"Crossref","is-referenced-by-count":14,"title":["Fast asynchronous systems in dense time"],"prefix":"10.1016","volume":"254","author":[{"given":"Lars","family":"Jenner","sequence":"first","affiliation":[]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00304-7_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB2","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF01191894","article-title":"An efficiency preorder for processes","volume":"29","author":"Arun-Kumar","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB3","series-title":"Structures in Concurrency Theory, Workshop in Computing","first-page":"55","article-title":"Conformance","author":"Arun-Kumar","year":"1995"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB4","series-title":"Proc. 6th Symp. on Logic in Computer Science","first-page":"110","article-title":"A theory of testing for real-time","author":"Cleaveland","year":"1991"},{"issue":"11","key":"10.1016\/S0304-3975(99)00304-7_BIB5","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s002360050107","article-title":"Performance preorder and competitive equivalence","volume":"34","author":"Corradini","year":"1997","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalence for processes","volume":"34","author":"De Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","article-title":"A process algebra for timed systems","volume":"117","author":"Hennessy","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB8","doi-asserted-by":"crossref","unstructured":"L. Jenner, Modular construction of fast asynchronous systems, Tech. Report 1996-2, Inst. f. Informatik, Univ. Augsburg, 1996.","DOI":"10.1007\/3-540-61440-0_118"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB9","doi-asserted-by":"crossref","unstructured":"L. Jenner, W. Vogler, Fast asynchronous systems in dense time, Tech. Report No. 344, Inst. f. Mathematik, Univ. Augsburg, 1995.","DOI":"10.1007\/3-540-61440-0_118"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB10","unstructured":"N. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, San Francisco, 1996."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(81)90109-2","article-title":"On describing the behaviour and implementation of distributed systems","volume":"13","author":"Lynch","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB12","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/inco.1995.1134","article-title":"Forward and backward simulations I: Untimed systems","volume":"121","author":"Lynch","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB13","first-page":"424","article-title":"Relating processes with respect to speed","volume":"vol. 527","author":"Moller","year":"1991"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB14","series-title":"Petri Net Theory","author":"Peterson","year":"1981"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB15","doi-asserted-by":"crossref","unstructured":"G. Peterson, M. Fischer, Economical solutions for the critical section problem in a distributed system, in: 9th ACM Symp. Theory of Computing, Boulder Colo. 1977, pp. 91\u201397.","DOI":"10.1145\/800105.803398"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","article-title":"Refusal testing","volume":"50","author":"Phillips","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB17","first-page":"227","article-title":"On time Petri nets","volume":"27","author":"Popova","year":"1991","journal-title":"J. Inform. Process. Cybern. EIK"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB18","unstructured":"W. Reisig, Petri Nets. EATCS Monographs on Theoretical Computer Science 4, Springer, Berlin, 1985."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB19","doi-asserted-by":"crossref","unstructured":"W. Vogler, Modular Construction and Partial Order Semantics of Petri Nets, Lecture Notes Comp. Sci., vol. 625, Springer, Berlin 1992.","DOI":"10.1007\/3-540-55767-9"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1995.1130","article-title":"Timed testing of concurrent systems","volume":"121","author":"Vogler","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00304-7_BIB21","doi-asserted-by":"crossref","unstructured":"W. Vogler, Faster asynchronous systems, in: I. Lee, S. Smolka (Eds.), CONCUR \u201995, Lecture Notes Comp. Sci., vol. 962, Springer, Berlin, 1995, pp. 299\u2013312. Full version as Report No. 317, Inst. f. Mathematik, Univ. Augsburg, 1995.","DOI":"10.1007\/3-540-60218-6_22"},{"key":"10.1016\/S0304-3975(99)00304-7_BIB22","unstructured":"W. Vogler, Efficiency of asynchronous systems and read arcs in Petri nets. in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), ICALP 97, Lecture Notes Comp. Sci., vol. 1256, Springer, Berlin, 1997, pp. 538\u2013548. Full version as Tech. Report No. 352, Inst. f. Mathematik, Univ. Augsburg, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T23:17:45Z","timestamp":1681341465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599003047"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00304-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}