{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:13:30Z","timestamp":1725473610674},"reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084780","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"17-31","source":"Crossref","is-referenced-by-count":8,"title":["Testing equivalence for Petri Nets with action refinement: Preliminary report"],"prefix":"10.1007","author":[{"given":"Lalita","family":"Jategaonkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Technical report","author":"L. Aceto","year":"1991","unstructured":"L. Aceto and U. Engberg. Failure semantics for a simple process language with refinement. Technical report, INRIA, Sophia-Antipolis, 1991."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"L. Aceto and M. Hennessy. Towards action-refinement in process algebras. In Proceedings of 4th LICS, pages 138\u2013145. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39168"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. In Proceedings of 18 th ICALP, volume 510 of Lecture Notes in Computer Science. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54233-7_159"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"S. D. Brookes and A. W. Roscoe. An improved failures model for communicating processes. In Seminar on Concurrency, volume 197 of Lecture Notes in Computer Science, pages 281\u2013305. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-15670-4_14"},{"key":"3_CR5","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. Europ. Assoc. Theoretical Computer Sci., 31:12\u201315, 1987.","journal-title":"Bull. Europ. Assoc. Theoretical Computer Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"U. Goltz. CCS and petri nets. Technical report, GMD, July 1990.","DOI":"10.1007\/3-540-53479-2_14"},{"key":"3_CR7","unstructured":"M. C. Hennessy. Algebraic Theory of Processes. Series on Foundations of Computing. MIT Press, 1988. 272 pp."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"M. C. Hennessy. Concurrent testing of processes. In Proceedings of 3rd CONCUR, 1992. Appears in this volume.","DOI":"10.1007\/BFb0084785"},{"key":"3_CR9","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice-Hall, Inc., 1985. 256 pp."},{"key":"3_CR10","unstructured":"L. Jategaonkar and A. R. Meyer. Testing equivalence for Petri nets with split and choice refinements. Paper presented at the Eighth Workshop on the Mathematical Foundations of Programming Semantics, Oxford, England, Apr. 1992."},{"key":"3_CR11","unstructured":"R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall, Inc., 1989."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"M. Nielsen, U. Engberg, and K. S. Larsen. Fully abstract models for a process language with refinement. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 523\u2013548. Springer-Verlag, 1988.","DOI":"10.1007\/BFb0013034"},{"key":"3_CR13","unstructured":"R. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, CWI, 1990."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 267\u2013300. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52559-9_68"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In Proceedings of PARLE Conference, volume 259 of Lecture Notes in Computer Science, pages 224\u2013242. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_13"},{"issue":"4","key":"3_CR16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00276021","volume":"26","author":"W. Vogler","year":"1989","unstructured":"W. Vogler. Failure semantics and deadlocking of modular petri nets. Acta Informatica, 26(4):333\u2013348, 1989.","journal-title":"Acta Informatica"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01798961","volume":"4","author":"W. Vogler","year":"1991","unstructured":"W. Vogler. Failures semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4:139\u2013162, 1991.","journal-title":"Distributed Computing"},{"key":"3_CR18","unstructured":"W. Vogler. Is partial order semantics necessary for action refinement? Technical report, Technische Universitat Munchen, 1991."}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084780.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T13:41:55Z","timestamp":1707399715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0084780","relation":{},"subject":[]}}