{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:40:20Z","timestamp":1736282420693,"version":"3.32.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s11390-005-0514-2","type":"journal-article","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T08:47:07Z","timestamp":1140166027000},"page":"514-525","source":"Crossref","is-referenced-by-count":2,"title":["Action Refinement for Real-Time Concurrent Processes with Urgency"],"prefix":"10.1007","volume":"20","author":[{"given":"Guang-Ping","family":"Qin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Zhao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"514_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"R van Glabbeek","year":"2001","unstructured":"R van Glabbeek, U Goltz. Refinement of actions and equivalence notions for concurrent systems. Acta Informatica, 2001, 37: 229\u2013327.","journal-title":"Acta Informatica"},{"key":"514_CR2","doi-asserted-by":"crossref","unstructured":"Gorrieri R, Rensink A. Action Refinement. Handbook of Process Algebra, Elsevier Science, 2001, pp.1047\u20131147.","DOI":"10.1016\/B978-044482830-9\/50034-5"},{"issue":"8","key":"514_CR3","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00236-003-0117-8","volume":"39","author":"M Majster-Cederbaum","year":"2003","unstructured":"Majster-Cederbaum M, Wu J. Towards action refinement for true concurrent real time. Acta Informatica, 2003, 39(8): 531\u2013577.","journal-title":"Acta Informatica"},{"key":"514_CR4","unstructured":"Katoen J-P. Quantitative and qualitative extensions of event structures [Dissertation]. University of Twente, 1996."},{"key":"514_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(01)00310-6","volume":"83","author":"H Fecher","year":"2002","unstructured":"Fecher H, Majster-Cederbaum M, Wu J. Bundle event structures: A revised cpo approach. Information Processing Letters, 2002, 83: 7\u201312.","journal-title":"Information Processing Letters"},{"key":"514_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1023\/A:1008649927166","volume":"12","author":"J-P Katoen","year":"1998","unstructured":"Katoen J-P, Langerak R, Brinksma E, Latella D, Bolognesi T. A consistent causality based view on a timed process algebra including urgent interactions. Formal Meth. Sys. Design, 1998, 12: 189\u2013216.","journal-title":"Formal Meth. Sys. Design"},{"key":"514_CR7","unstructured":"Langerak R. Bundle Event Structures: A Non-Interleaving Semantics for LOTOS. Formal Description Techniques, Elsevier Science Publishers, 1993, pp.331\u2013346."},{"key":"514_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T Bolognesi","year":"1987","unstructured":"Bolognesi T, Brinksma E. Introduction to the ISO specification language LOTOS. Comp. Netw. ISDN Syst., 1987, 14: 25\u201329.","journal-title":"Comp. Netw. ISDN Syst."},{"key":"514_CR9","doi-asserted-by":"crossref","unstructured":"Bowman H, Derrick J. Extending LOTOS with time: A true concurrency perspective. Lecture Notes in Computer Science 1231, 1997, pp.383\u2013399.","DOI":"10.1007\/3-540-63010-4_26"},{"issue":"1-2","key":"514_CR10","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0304-3975(99)00342-4","volume":"254","author":"J-P Katoen","year":"2001","unstructured":"Katoen J-P, Baier C, Latella D. Metric semantics for true concurrent real time. Theoretical Computer Science, 2001, 254(1-2): 501\u2013542.","journal-title":"Theoretical Computer Science"},{"key":"514_CR11","doi-asserted-by":"crossref","unstructured":"Katoen J-P, Langerak R, Latella D, Brinksma E. On specifying real-time systems in a causality-based setting. Lecture Notes in Computer Science 1135, 1996, pp.385\u2013405.","DOI":"10.1007\/3-540-61648-9_52"},{"issue":"3","key":"514_CR12","first-page":"620","volume":"70","author":"H Fecher","year":"2002","unstructured":"Fecher H, Majster-Cederbaum M, Wu J. Refinement of actions in a real-time process algebra with a true concurrency model. Electronic Notes in Theoretical Computer Science, 2002, 70(3): 620\u2013640.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"514_CR13","doi-asserted-by":"crossref","unstructured":"Majster-Cederbaum M, Wu J. Action refinement for true concurrent real time. In Proc. ICECCS 2001, IEEE Computer Society Press, 2001, pp.58\u201368.","DOI":"10.1109\/ICECCS.2001.930164"},{"key":"514_CR14","doi-asserted-by":"crossref","unstructured":"I Czaja, R van Glabbeek, U Goltz. Interleaving semantics and action refinement with atomic choice. Lecture Notes in Computer Science 609, 1992, pp.89\u2013107.","DOI":"10.1007\/3-540-55610-9_169"},{"key":"514_CR15","doi-asserted-by":"crossref","unstructured":"R van Glabbeek, U Goltz. Refinement of actions in causality based models. Lecture Notes in Computer Science 430, 1990, pp.267\u2013300.","DOI":"10.1007\/3-540-52559-9_68"},{"key":"514_CR16","doi-asserted-by":"crossref","unstructured":"Murphy D, Pitt D. Real-timed concurrent refineable behaviours. Lecture Notes in Computer Science 571, 1992, pp.529\u2013545.","DOI":"10.1007\/3-540-55092-5_29"},{"key":"514_CR17","doi-asserted-by":"crossref","unstructured":"R van Glabbeek. The linear time \u2014 Branching time spectrum I: The semantics of concrete, sequential processes. Lecture Notes in Computer Science 430, 1990, pp.267\u2013300.","DOI":"10.1007\/BFb0039066"},{"key":"514_CR18","doi-asserted-by":"crossref","unstructured":"R van Glabbeek. The linear time \u2014 Branching time spectrum II: The semantics of sequential processes with silent moves. In Concurrency Theory, Best E (ed.), LNCS 715, 1993, pp.66\u201381.","DOI":"10.1007\/3-540-57208-2_6"},{"key":"514_CR19","doi-asserted-by":"crossref","unstructured":"Goltz U, Gorrieri R, Rensink A. On syntactic and semantic action refinement. Lecture Notes in Computer Science 789, 1994, pp.385\u2013404.","DOI":"10.1007\/3-540-57887-0_106"},{"key":"514_CR20","doi-asserted-by":"crossref","unstructured":"Aceto L, Action Refinement in Process Algebra. Cambridge Univ. Press, 1992.","DOI":"10.1007\/3-540-54233-7_159"},{"issue":"3","key":"514_CR21","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2003.08.009","volume":"318","author":"M Majster-Cederbaum","year":"2004","unstructured":"Majster-Cederbaum M, Salger F. Towards the hierarchical verification of reactive systems. Theoretical Computer Science, 2004, 318(3): 243\u2013296.","journal-title":"Theoretical Computer Science"},{"key":"514_CR22","doi-asserted-by":"crossref","unstructured":"Winskel G. An introduction to event structures. Lecture Notes in Computer Science 354, 1989, pp.364\u2013397.","DOI":"10.1007\/BFb0013026"},{"key":"514_CR23","doi-asserted-by":"crossref","unstructured":"Hoare C A R. Communicating Sequential Processes, Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"514_CR24","doi-asserted-by":"crossref","unstructured":"Milner R. A calculus of communicating systems. Lecture Notes in Computer Science 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"514_CR25","doi-asserted-by":"crossref","unstructured":"Fecher H, Majster-Cederbaum M, Wu J. Action refinement for probabilistic processes with true concurrency models. Lecture Notes in Computer Science 2399, 2002, pp.77\u201394.","DOI":"10.1007\/3-540-45605-8_6"},{"key":"514_CR26","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s002360050047","volume":"33","author":"L Aceto","year":"1996","unstructured":"Aceto L, Murphy D. Timing and causality in process algebra. Acta Informatica, 1996, 33: 317\u2013350.","journal-title":"Acta Informatica"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-005-0514-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-005-0514-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-005-0514-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:06:20Z","timestamp":1736280380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-005-0514-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s11390-005-0514-2","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}