{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:43:21Z","timestamp":1725576201601},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231677"},{"type":"electronic","value":"9783540302063"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30206-3_17","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:19:15Z","timestamp":1295345955000},"page":"231-245","source":"Crossref","is-referenced-by-count":0,"title":["The Influence of Durational Actions on Time Equivalences"],"prefix":"10.1007","author":[{"given":"Harald","family":"Fecher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Murphy, D.: On the ill-timed but well-caused. In: Best [6], pp. 97\u2013111","DOI":"10.1007\/3-540-57208-2_8"},{"key":"17_CR2","doi-asserted-by":"publisher","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\u00a033, 317\u2013350 (1996)","journal-title":"Acta Informatica"},{"key":"17_CR3","unstructured":"Bednarczyk, M.A.: Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Institute of Computer Science, Polish Academy of Science (1991)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Fokkink, W., Ponse, A.: Process algebra with recursive operations. In: Bergstra et al. [5], pp. 333\u2013389","DOI":"10.1016\/B978-044482830-9\/50023-0"},{"volume-title":"Handbook of Process Algebra","year":"2001","key":"17_CR5","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 1993","year":"1993","unstructured":"Best, E. (ed.): CONCUR 1993. LNCS, vol.\u00a0715. Springer, Heidelberg (1993)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-17660-8_52","volume-title":"TAPSOFT \u201987 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987.","author":"G. Boudol","year":"1987","unstructured":"Boudol, G., Castellani, I.: On the semantics of concurrency: Partial orders and transition systems. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol.\u00a0249, pp. 123\u2013137. Springer, Heidelberg (1987)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0000467","volume-title":"Algebraic Methodology and Software Technology","author":"X.J. Chen","year":"1997","unstructured":"Chen, X.J., Corradini, F.: On the specification and verification of performance properties for a timed process algebra. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 123\u2013137. Springer, Heidelberg (1997)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1006\/inco.1999.2821","volume":"156","author":"F. Corradini","year":"2000","unstructured":"Corradini, F.: Absolute versus relative time in process algebras. Information and Computation\u00a0156, 122\u2013172 (2000)","journal-title":"Information and Computation"},{"key":"17_CR10","first-page":"105","volume-title":"Formal Description of Programming Concepts \u2013 III, Proceedings of the 3th IFIP WG 2.2 working conference, Ebberup 1986","author":"P. Degano","year":"1987","unstructured":"Degano, P., Nicola, R.D., Montanari, U.: Observational equivalences for concurrency models. In: Wirsing, M. (ed.) Formal Description of Programming Concepts \u2013 III, Proceedings of the 3th IFIP WG 2.2 working conference, Ebberup 1986, pp. 105\u2013129. North-Holland, Amsterdam (1987)"},{"issue":"5","key":"17_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.ipl.2003.11.008","volume":"89","author":"H. Fecher","year":"2004","unstructured":"Fecher, H.: A completed hierarchy of true concurrent equivalences. Information Processing Letters\u00a089(5), 261\u2013265 (2004)","journal-title":"Information Processing Letters"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"R.: v. Glabbeek. The linear time\u2013branching time spectrum II: The semantics of sequential systems with silent moves (extended abstract). In: Best [6], pp. 66\u201381","DOI":"10.1007\/3-540-57208-2_6"},{"key":"17_CR13","unstructured":"R.: v. Glabbeek. The linear time\u2013branching time spectrum I. The semantics of concrete, sequential processes. In: Bergstra et al. [5], pp. 3\u201399"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-52559-9_68","volume-title":"Stepwise Refinement of Distributed Systems","author":"R.v. Glabbeek","year":"1990","unstructured":"Glabbeek, R.v., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol.\u00a0430, pp. 267\u2013300. Springer, Heidelberg (1990)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"R.v. Glabbeek","year":"2001","unstructured":"Glabbeek, R.v., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica\u00a037, 229\u2013327 (2001)","journal-title":"Acta Informatica"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/LICS.1995.523257","volume-title":"Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science","author":"R.v. Glabbeek","year":"1995","unstructured":"Glabbeek, R.v., Plotkin, G.D.: Configuration structures. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, pp. 199\u2013209. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R.v. Glabbeek","year":"1987","unstructured":"Glabbeek, R.v., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 224\u2013242. Springer, Heidelberg (1987)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Gorrieri, R., Rensink, A.: Action refinement. In: Bergstra et al. [5], pp. 1047\u2013 1147","DOI":"10.1016\/B978-044482830-9\/50034-5"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)00205-W","volume":"140","author":"R. Gorrieri","year":"1995","unstructured":"Gorrieri, R., Roccetti, M., Stancampiano, E.: A theory of processes with durational actions. Theoretical Computer Science\u00a0140, 73\u201394 (1995)","journal-title":"Theoretical Computer Science"},{"key":"17_CR20","series-title":"International Series in Computer Science","volume-title":"Communications Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communications Sequential Processes. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-61648-9_52","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J.-P. Katoen","year":"1996","unstructured":"Katoen, J.-P., Langerak, R., Latella, D., Brinksma, E.: On specifying real-time systems in a causality-based setting. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol.\u00a01135, pp. 385\u2013404. Springer, Heidelberg (1996)"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science\u00a025, 267\u2013310 (1983)","journal-title":"Theoretical Computer Science"},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"403","DOI":"10.3233\/FI-1993-193-410","volume":"19","author":"D. Murphy","year":"1993","unstructured":"Murphy, D.: Time and duration in noninterleaving concurrency. Fundamenta Informaticae\u00a019, 403\u2013416 (1993)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BFb0016222","volume-title":"Advances in Petri Nets 1985","author":"L. Pomello","year":"1986","unstructured":"Pomello, L.: Some Equivalence Notions for Concurrent Systems. An Overview. In: Rozenberg, G. (ed.) APN 1985. LNCS, vol.\u00a0222, pp. 381\u2013400. Springer, Heidelberg (1986)"},{"issue":"4","key":"17_CR25","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A. Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fundamenta Informaticae\u00a011(4), 357\u2013404 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-45575-2_21","volume-title":"Perspectives of System Informatics","author":"I.B. Virbitskaite","year":"2001","unstructured":"Virbitskaite, I.B.: Observational semantics for timed event structures. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, pp. 214\u2013224. Springer, Heidelberg (2001)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","first-page":"217","volume-title":"Automata, Languages and Programming","author":"Y. Wang","year":"1991","unstructured":"Wang, Y.: CCS+time = an interleaving model for real time systems. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 217\u2013228. Springer, Heidelberg (1991)"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 364\u2013397. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30206-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T15:28:50Z","timestamp":1637162930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30206-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231677","9783540302063"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30206-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}