{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:49:36Z","timestamp":1742932176701,"version":"3.40.3"},"publisher-location":"London","reference-count":26,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199823"},{"type":"electronic","value":"9781447130789"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3078-9_20","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T02:47:45Z","timestamp":1323658065000},"page":"294-309","source":"Crossref","is-referenced-by-count":2,"title":["An Event-Based SOS for a Language with Refinement"],"prefix":"10.1007","author":[{"given":"Arend","family":"Rensink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/3-540-54233-7_159","volume-title":"Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science","author":"L Aceto","year":"1991","unstructured":"L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. In J. Leach Albert, B. Monien, and M. R. Artalejo, editors, Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science, pages 506\u2013519. Springer-Verlag, 1991. To apear in Information and Computation."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/inco.1993.1019","volume":"103","author":"L Aceto","year":"1993","unstructured":"L. Aceto and M. Hennessy. Towards action-refinement in process algebras. Information and Computation, 103: 204\u2013269, 1993.","journal-title":"Information and Computation"},{"key":"20_CR3","volume-title":"University of Sussex","author":"MA Bednarczyk","year":"1987","unstructured":"M. A. Bednarczyk. Categories of Asynchronous Systems. PhD thesis, University of Sussex, Oct. 1987."},{"key":"20_CR4","volume-title":"P. Enjalbert, A. Finkel, and K. W. Wagner, editors, STACS 93, volume 665 of Lecture Notes in Computer Science, pages 130\u2013140. Springer-Verlag","author":"E Best","year":"1993","unstructured":"E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, STACS 93, volume 665 of Lecture Notes in Computer Science, pages 130\u2013140. Springer-Verlag, 1993."},{"key":"20_CR5","volume-title":"J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 411\u2013427. Springer-Verlag","author":"G Boudol","year":"1989","unstructured":"G. Boudol and I. Castellani. Permutations of transitions: An event structure semantics for CCS and SCCS. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 411\u2013427. Springer-Verlag, 1989."},{"key":"20_CR6","volume-title":"Three equivalent semantics for CCS. Rapports de Recherche","author":"G Boudol","year":"1991","unstructured":"G. Boudol and I. Castellani. Flow models of distributed computations: Three equivalent semantics for CCS. Rapports de Recherche 1484, INRIA, July 1991. To appear in Information and Computation."},{"key":"20_CR7","volume-title":"E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, volume A-56 of IFIP Transactions, pages 169\u2013188. IFIP","author":"N Busi","year":"1994","unstructured":"N. Busi, R. van Glabbeek, and R. Gorrieri. Axiomatising ST bisimulation equivalence. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, volume A-56 of IFIP Transactions, pages 169\u2013188. IFIP, 1994."},{"key":"20_CR8","volume-title":"Springer-Verlag","author":"WR Cleaveland","year":"1992","unstructured":"W. R. Cleaveland, editor. Concur 992, volume 630 of Lecture Notes in Computer Science. Springer-Verlag, 1992."},{"key":"20_CR9","volume-title":"G. Rozenberg, editor, Advances in Petri Nets 1992, volume 609 of Lecture Notes in Computer Science, pages 89\u2013109. Springer-Verlag","author":"I Czaja","year":"1992","unstructured":"I. Czaja, R. J. van Glabbeek, and U. Goltz. Interleaving semantics and action refinement with atomic choice. In G. Rozenberg, editor, Advances in Petri Nets 1992, volume 609 of Lecture Notes in Computer Science, pages 89\u2013109. Springer-Verlag, 1992."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0304-3975(93)90361-V","volume":"118","author":"P Darondeau","year":"1993","unstructured":"P. Darondeau and P. Degano. Refinement of actions in event structures and causal trees. Theoretical Comput. Sci., 118: 21\u201348, 1993.","journal-title":"Theoretical Comput Sci"},{"key":"20_CR11","first-page":"223","volume":"Sci75","author":"P. Degano","year":"1991","unstructured":"P. Degano, R. De Nicola, and U. Montanari. A partial ordering semantics for CCS. Theoretical Comput Sci75: 223\u2013262, 1991.","journal-title":"Theoretical Comput"},{"key":"20_CR12","volume-title":"Technical Report TR-28\/92","author":"P Degano","year":"1992","unstructured":"P. Degano and R. Gorrieri. An operational definition of action refinement. Technical Report TR-28\/92, Universit\u00e0 di Pisa, 1992. To appear in Information and Computation."},{"key":"20_CR13","volume-title":"A. Kreczmar and G. Mirkowska, editors, Mathematical Foundations of Computer Science 1989, volume 379 of Lecture Notes in Computer Science, pages 237\u2013248. Springer-Verlag","author":"R van Glabbeek","year":"1989","unstructured":"R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In A. Kreczmar and G. Mirkowska, editors, Mathematical Foundations of Computer Science 1989, volume 379 of Lecture Notes in Computer Science, pages 237\u2013248. Springer-Verlag, 1989."},{"key":"20_CR14","volume-title":"J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems \u2014 Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 267\u2013300. Springer-Verlag","author":"R van Glabbeek","year":"1990","unstructured":"R. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems \u2014 Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 267\u2013300. Springer-Verlag, 1990."},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-57887-0_106","volume-title":"Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science","author":"U Goltz","year":"1994","unstructured":"U. Goltz, R. Gorrieri, and A. Rensink. On syntactic and semantic action refinement. In M. Hagiya and J. C. Mitchell, editors, Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 385\u2013404. Springer-Verlag, Apr. 1994."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"JF Groote","year":"1993","unstructured":"J. F. Groote. Transition system specifications with negative premises. Theoretical Comput Sci., 118: 263\u2013299, 1993.","journal-title":"Theoretical Comput Sci"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"L. Jategaonkar and A. Meyer. Testing equivalences for Petri nets with action refinement. In Cleaveland [8], pages 17\u201331.","DOI":"10.1007\/BFb0084780"},{"key":"20_CR18","volume-title":"Transformations and Semantics for LOTOS","author":"R Langerak","year":"1992","unstructured":"R. Langerak. Transformations and Semantics for LOTOS. PhD thesis, University of Twente, Nov. 1992."},{"key":"20_CR19","volume-title":"J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency, volume 803 of Lecture Notes in Computer Science, pages 425\u2013476. Springer-Verlag","author":"M Nielsen","year":"1994","unstructured":"M. Nielsen, V. Sassone, and G. Winskel. Relationships between models for concurrency. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency, volume 803 of Lecture Notes in Computer Science, pages 425\u2013476. Springer-Verlag, 1994."},{"key":"20_CR20","first-page":"1992","volume-title":"Mathematical Foundations of Computer Science","author":"GM Pinna","year":"1992","unstructured":"G. M. Pinna and A. Poigne. On the nature of events. In Mathematical Foundations of Computer Science 1992, Lecture Notes in Computer Science. Springer-Verlag, 1992."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"A. Rensink. Posets for configurations! In Cleaveland [8], pages 269\u2013285.","DOI":"10.1007\/BFb0084797"},{"key":"20_CR22","volume-title":"Models and Methods for Action Refinement","author":"A Rensink","year":"1993","unstructured":"A. Rensink. Models and Methods for Action Refinement. PhD thesis, University of Twente, Enschede, Netherlands, Aug. 1993."},{"key":"20_CR23","first-page":"228","volume":"51","author":"A Rensink","year":"1993","unstructured":"A. Rensink. Order isomorphism does not preserve independence. Bull. Eur. Ass. Theoret. Comput. Sci., 51: 228\u2013235, Oct. 1993.","journal-title":"Bull. Eur. Ass. Theoret. Comput. Sci."},{"issue":"5","key":"20_CR24","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"MW Shields","year":"1985","unstructured":"M. W. Shields. Concurrent machines. The Computer Journal, 28 (5): 449\u2013465, 1985.","journal-title":"The Computer Journal"},{"key":"20_CR25","volume-title":"M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, pages 53\u201379. Springer-Verlag","author":"EW Stark","year":"1990","unstructured":"E. W. Stark. Connections between a concrete and an abstract model of concurrent systems. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, pages 53\u201379. Springer-Verlag, 1990."},{"key":"20_CR26","volume-title":"C. Choffrut and T. Lengauer, editors, STACS 90, volume 415 of Lecture Notes in Computer Science, pages 285\u2013297. Springer-Verlag","author":"W Vogler","year":"1990","unstructured":"W. Vogler. Failures semantics based on interval semi words is a congruence for refinement. In C. Choffrut and T. Lengauer, editors, STACS 90, volume 415 of Lecture Notes in Computer Science, pages 285\u2013297. Springer-Verlag, 1990."}],"container-title":["Workshops in Computing","Structures in Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3078-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T18:07:48Z","timestamp":1686506868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-3078-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199823","9781447130789"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3078-9_20","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}