{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:19Z","timestamp":1725456319616},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029990","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:24:59Z","timestamp":1133400299000},"page":"468-477","source":"Crossref","is-referenced-by-count":1,"title":["Dependency-based action refinement"],"prefix":"10.1007","author":[{"given":"Arend","family":"Rensink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"issue":"2","key":"47_CR1","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(2):204\u2013269, 1993.","journal-title":"Information and Computation"},{"issue":"2","key":"47_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1006\/inco.1994.1096","volume":"115","author":"L. Aceto","year":"1994","unstructured":"L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. Information and Computation, 115(2):179\u2013247, 1994.","journal-title":"Information and Computation"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. In Enjalbert, Finkel, and Wagner, eds., STACS 93, vol. 665 of LNCS, pp. 130\u2013140. Springer, 1993.","DOI":"10.1007\/3-540-56503-5_16"},{"issue":"1","key":"47_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232\u2013268, Jan. 1995.","journal-title":"Journal of the ACM"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"E. Brinksma, B. Jonsson, and F. Orava. Refining interfaces of communicating systems. In Abramsky and Maibaum, eds., TAPSOFT '91, Volume 2, vol. 494 of LNCS, pp. 297\u2013312. Springer, 1991.","DOI":"10.1007\/3540539816_73"},{"key":"47_CR6","unstructured":"N. Busi, R. van Glabbeek, and R. Gorrieri. Axiomatising ST bisimulation equivalence. In Olderog, ed., Programming Concepts, Methods and Calculi, vol. A-56 of IFIP Transactions, pp. 169\u2013188. IFIP, 1994."},{"key":"47_CR7","first-page":"12","volume":"31","author":"L. Castellano","year":"1987","unstructured":"L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs. interleaving: An instructive example. Bull. Eur. Ass. Theoret. Comput. Sci., 31:12\u201315, 1987. Note.","journal-title":"Bull. Eur. Ass. Theoret. Comput. Sci."},{"key":"47_CR8","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 Computer Science, 118:21\u201348, 1993.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/inco.1995.1142","volume":"122","author":"P. Degano","year":"1995","unstructured":"P. Degano and R. Gorrieri. A causal operational semantics of action refinement. Information and Computation, 122(1):97\u2013119, 1995.","journal-title":"Information and Computation"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"P. Degano, R. Gorrieri, and G. Rosolini. A categorical view of process refinement. In de Bakker, de Roever, and Rozenberg, eds., Semantics: Foundations and Applications, vol. 666 of LNCS, pp. 138\u2013153. Springer, 1992.","DOI":"10.1007\/3-540-56596-5_32"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek and U. Goltz. Equivalences and refinement. In Guessarian, ed., 18\u00e9me Ecole de Printemps d'Informatique Th\u00e9orique Semantique du Parallelisme, vol. 469 of LNCS, 1990.","DOI":"10.1007\/3-540-53479-2_13"},{"issue":"2","key":"47_CR12","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1006\/inco.1996.0026","volume":"125","author":"U. Goltz","year":"1996","unstructured":"U. Goltz, R. Gorrieri, and A. Rensink. Comparing syntactic and semantic action refinement. Information and Computation, 125(2):118\u2013143, 1996.","journal-title":"Information and Computation"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"M. Huhn. Action refinement and property inheritance in systems of sequential agents. In Montanari and Sassone, eds., Concur'96, vol. 1119 of LNCS, pp. 639\u2013654. Springer, 1996.","DOI":"10.1007\/3-540-61604-7_81"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"W. Janssen, M. Poel, and J. Zwiers. Actions systems and action refinement in the development of parallel systems. In Baeten and Groote, eds., Concur '91, vol. 527 of LNCS, pp. 298\u2013316. Springer, 1991.","DOI":"10.1007\/3-540-54430-5_96"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"L. Jategaonkar and A. Meyer. Testing equivalences for Petri nets with action refinement. In Cleaveland, ed., Concur '92, vol. 630 of LNCS, pp. 17\u201331. Springer, 1992.","DOI":"10.1007\/BFb0084780"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Basic notions of trace theory. In de Bakker, de Roever, and Rozenberg, eds., Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol. 354 of LNCS, pp. 285\u2013363. Springer, 1989.","DOI":"10.1007\/BFb0013025"},{"key":"47_CR17","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"M. Nielsen, U. Engberg, and K. G. Larsen. Fully abstract models for a process language with refinement. In de Bakker, de Roever, and Rozenberg, eds., Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol. 354 of LNCS, pp. 523\u2013549. Springer, 1989.","DOI":"10.1007\/BFb0013034"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Deussen, ed., Proceedings 5th GI Conference, vol. 104 of LNCS, pp. 167\u2013183. Springer, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"A. Rensink. Posets for configurations! In Cleaveland, ed., Concur '92, vol. 630 of LNCS, pp. 269\u2013285. Springer, 1992.","DOI":"10.1007\/BFb0084797"},{"key":"47_CR21","unstructured":"A. Rensink. Methodological aspects of action refinement. In Olderog, ed., Programming concepts, methods and calculi, vol. A-56 of IFIP Transactions. IFIP, 1994."},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"A. Rensink. An event-based SOS for a language with refinement. In Desel, ed., Structures in Concurrency Theory, Workshops in Computing, pp. 294\u2013309. Springer, 1995.","DOI":"10.1007\/978-1-4471-3078-9_20"},{"key":"47_CR23","doi-asserted-by":"crossref","unstructured":"A. Rensink and R. Gorrieri. Action refinement as an implementation relation. In Bidoit and Dauchet, eds., TAPSOFT '97. Theory and Practice of Software Development, vol. 1214 of LNCS, pp. 772\u2013786. Springer, 1997.","DOI":"10.1007\/BFb0030640"},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"A. Rensink and H. Wehrheim. Weak sequential composition in process algebras. In Jonsson and Parrow, eds., Concur '94: Concurrency Theory, vol. 836 of LNCS, pp. 226\u2013241. Springer, 1994.","DOI":"10.1007\/978-3-540-48654-1_20"},{"key":"47_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01798961","volume":"4","author":"W. Vogler","year":"1991","unstructured":"W. Vogler. Failure semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4:139\u2013162, 1991.","journal-title":"Distributed Computing"},{"key":"47_CR26","unstructured":"H. Wehrheim. Parametric action refinement. In Olderog, ed., IFIP Transactions: Programming Concepts, Methods and Calculi, pp. 247\u2013266. Elsevier, 1994."},{"key":"47_CR27","unstructured":"H. Wehrheim. Specifying Reactive Systems with Action Dependencies: Modelling and Hierarchical Design. PhD thesis, University of Hildesheim, 1996."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:22:16Z","timestamp":1586578936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0029990","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}