{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:49Z","timestamp":1725490309399},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73814-5_17","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T05:31:44Z","timestamp":1188624704000},"page":"178-190","source":"Crossref","is-referenced-by-count":2,"title":["A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement"],"prefix":"10.1007","author":[{"given":"Guang","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaorong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinzhao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/B978-044482830-9\/50025-4","volume-title":"Handbook of Process Algebra","author":"A. Ing\u00f3lfsd\u00f3ttir","year":"2001","unstructured":"Ing\u00f3lfsd\u00f3ttir, A., Lin, H.: A symbolic Approach to value passing Processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 427\u2013478. Elsevier, Amsterdam (2001)"},{"key":"17_CR2","unstructured":"Bossi, A., Piazza, C., Rossi, S.: Preserving (Security) Properties under Action Refinement. In: CILC 2004, Parma (June 2004)"},{"key":"17_CR3","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International, Englewood Cliffs (1985)"},{"key":"17_CR4","first-page":"273","volume-title":"IFM 1999","author":"C. Bolton","year":"1999","unstructured":"Bolton, C., Davies, J., Woodcock, J.: On the Refinement and Simulation of Data Types and Processes. In: IFM 1999. Proceedings of the 1st International Conference on Integrated Formal Methods, pp. 273\u2013292. Springer, Heidelberg (1999)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45605-8_6","volume-title":"Process Algebra and Probabilistic Methods. Performance Modeling and Verification","author":"H. Fecher","year":"2002","unstructured":"Fecher, H., Majster-Cederbaum, M., Wu, J.: Action refinement for probabilistic processes with true concurrency models. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol.\u00a02399, pp. 77\u201394. Springer, Heidelberg (2002)"},{"key":"17_CR6","doi-asserted-by":"crossref","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\u00a070(3) (2002)","DOI":"10.1016\/S1571-0661(05)80496-7"},{"key":"17_CR7","first-page":"1047","volume-title":"Handbook of Process Algebra","author":"U. Goltz","year":"2001","unstructured":"Goltz, U., Gorrieri, R., Rensink, A.: Techinical Report UBLCS-99-09, University of Bologna, 1999. In: Handbook of Process Algebra, ch. XVI, pp. 1047\u20131147. Elsevier Science, Amsterdam (2001)"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of Communitating Processes with Abstraction. TCS\u00a037(1), 77\u2013121 (1985)","journal-title":"TCS"},{"key":"17_CR9","unstructured":"Katoen, J.P.: Concepts, Algorithms and Tools for Model Checking. Friedrich-Alexander Universit\u00e4t Erlangen-N\u00fcrnberg (1999)"},{"key":"17_CR10","unstructured":"Katoen, J.P.: Quantitative and qualitative extensions of event structures, PhD thesis, University of Twente (1996)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014555","volume-title":"Theoretical Aspects of Computer Software","author":"J. Rathke","year":"1997","unstructured":"Rathke, J., Hennessy, M.: Local Model Checking for value passing Processes (Extended Abstract). In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol.\u00a01281, Springer, Heidelberg (1997)"},{"key":"17_CR12","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"113","volume-title":"EXPRESS 2003","author":"H. Fecher","year":"2004","unstructured":"Fecher, H.: Event Structures for Interrupt Process Algebras. In: EXPRESS 2003. Electronic Notes in Theoretical Computer Science, vol.\u00a096, pp. 113\u2013127. Elsevier Science Publishers, Amsterdam (2004)"},{"key":"17_CR13","volume-title":"Action-refinement in Process Algebra","author":"L. Aceto","year":"1992","unstructured":"Aceto, L.: Action-refinement in Process Algebra. Cambridge Univ. Press, Cambridge (1992)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/3-540-54233-7_159","volume-title":"Automata, Languages and Programming","author":"L. Aceto","year":"1991","unstructured":"Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol.\u00a0510, pp. 506\u2013519. Springer, Heidelberg (1991)"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/inco.1993.1019","volume":"103","author":"L. Aceto","year":"1993","unstructured":"Aceto, L., Hennessy, M.: Towards action refinement in process algebras. Information and Computation\u00a0103(2), 204\u2013269 (1993)","journal-title":"Information and Computation"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1006\/inco.1994.1096","volume":"115","author":"L. Aceto","year":"1994","unstructured":"Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. Information and Computation\u00a0115(2), 179\u2013247 (1994)","journal-title":"Information and Computation"},{"key":"17_CR17","first-page":"379","volume-title":"Formal Aspects of Computing","author":"M. Hennessy","year":"1996","unstructured":"Hennessy, M., Lin, H.: Proof systems for message-passing process algebras. In: Formal Aspects of Computing, vol.\u00a08, pp. 379\u2013407. Springer, London (1996)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-540-39893-6_14","volume-title":"Formal Methods and Software Engineering","author":"M. Majster-Cederbaum","year":"2003","unstructured":"Majster-Cederbaum, M., Wu, J.: Adding action refinement to stochastic true concurrency models. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol.\u00a02885, pp. 226\u2013245. Springer, Heidelberg (2003)"},{"key":"17_CR19","first-page":"58","volume-title":"Proc. ICECCS 2001","author":"M. Majster-Cederbaum","year":"2001","unstructured":"Majster-Cederbaum, M., Wu, J.: Action refinement for true concurrent real time. In: Proc. ICECCS 2001, pp. 58\u201368. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"17_CR20","doi-asserted-by":"publisher","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\u00a039, 531\u2013577 (2003)","journal-title":"Acta Informatica"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-45187-7_4","volume-title":"CONCUR 2003 - Concurrency Theory","author":"R. Glabbeek van","year":"2003","unstructured":"van Glabbeek, R., Vaandrager, F.: Bundle Event Structures and CCSP. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 57\u201371. Springer, Heidelberg (2003)"},{"key":"17_CR22","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. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R., Goltz, U.: Refinement of Actions in Causality Based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Stepwise Refinement of Distributed Systems. LNCS, vol.\u00a0430, pp. 267\u2013300. Springer, Heidelberg (1990)"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s002360000041","volume":"37","author":"R. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica\u00a037, 29\u2013327 (2001)","journal-title":"Acta Informatica"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Gorrieri, R., Rensink, A.: Action Refinement. In: Handbook of Process Algebra (2001)","DOI":"10.1016\/B978-044482830-9\/50034-5"},{"key":"17_CR25","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"17_CR26","unstructured":"Deng, W., Lin, H.: Extended Symbolic Transition Graphs with Assignment. In: Proceedings of the 29th Annual International Computer Software and Applications Conference (COMPSAC 2005), vol.\u00a01 (July 2005)"},{"issue":"4","key":"17_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/362575.362577","volume":"14","author":"N. Wirth","year":"1971","unstructured":"Wirth, N.: Program Development by Stepwise Refinement. Communications of ACM\u00a014(4), 221\u2013227 (1971)","journal-title":"Communications of ACM"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73814-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:00:20Z","timestamp":1619517620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73814-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738138"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73814-5_17","relation":{},"subject":[]}}