{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:27Z","timestamp":1725663207757},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:59:58Z","timestamp":1330203598000},"page":"107-132","source":"Crossref","is-referenced-by-count":1,"title":["Correctness of concurrent processes"],"prefix":"10.1007","author":[{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"7_CR1","volume-title":"Proc. Workshop on Combining Methods","author":"E. Astesiano","year":"1984","unstructured":"E. Astesiano, Combining an operational with an algebraic approach to the specification of concurrency, in: D. Bj\u00f8rner (Ed.), Proc. Workshop on Combining Methods (Nyborg, Denmark, 1984)"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"B. Alpern, F.B. Schneider, Defining liveness, Inform. Proc. Letters 21 (1985) 181\u2013185.","journal-title":"Inform. Proc. Letters"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(88)90026-8","volume":"36","author":"J. W. Bakker de","year":"1988","unstructured":"J.W. de Bakker, J.-J. Meyer, E.-R. Olderog, J.I. Zucker, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, J. Comput. System Sci. 36 (1988) 158\u2013224.","journal-title":"J. Comput. System Sci."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-17906-2_33","volume":"255","author":"E. Best","year":"1987","unstructured":"E. Best, COSY: its relation to nets and CSP, in: W. Brauer, W. Reisig, G. Rozenberg (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Comput. Sci. 255 (Springer-Verlag, 1987) 416\u2013440.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"7_CR5","unstructured":"J.A. Bergstra, J.W. Klop, E.-R. Olderog, Failures without chaos: a new process semantics for fair abstraction, in: M. Wirsing (Ed.), Proc. IFIP Working Conference on Formal Description of Programming Concepts III (North-Holland, 1987) 77\u2013101."},{"key":"7_CR6","unstructured":"M. Bretschneider, M. Duque Anton, A. Fink, Constructing and verifying protocols using TCSP, in: S. Aggarwal, K. Sabnani (Ed.), Proc. IFIP Working Conference on Protocol Specification, Testing and Verification (North-Holland, 1988)."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (1984) 560\u2013599.","journal-title":"J. ACM"},{"key":"7_CR8","unstructured":"Z. Chaochen, C.A.R. Hoare, Partial correctness of communicating processes, in: Proc. 2nd Intern. Conf. on Distributed Comput. Systems, Paris, 1981."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. DeNicola","year":"1984","unstructured":"R. DeNicola, M. Hennessy, Testing equivalences for processes, Theoret. Comput. Sci. 34 (1984) 83\u2013134.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR10","volume-title":"A Discipline of Programming","author":"E. W. Dijkstra","year":"1976","unstructured":"E.W. Dijkstra, A Discipline of Programming (Prentice-Hall, Englewood Cliffs, NJ, 1976)."},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-50940-2_33","volume":"352","author":"M. Duque Ant\u00f3n","year":"1989","unstructured":"M. Duque Ant\u00f3n, M. Bretschneider, Formulas, processes and Petri-nets applied to the specification and verification of a HDLC protocol, in J. Diaz, F. Orejas (Eds.), Proc. TAPSOFT '89, Vol. 2 Lecture Notes in Comput. Sci. 352 (Springer-Verlag, 1989) 140\u2013154.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"7_CR12","unstructured":"U. Goltz, \u00dcber die Darstellung von CCS-Programmen durch Petrinetze, Doctoral Diss., RWTH Aachen, 1988."},{"key":"7_CR13","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy, Algebraic Theory of Processes (MIT Press, Cambridge, Mass., 1988)."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","volume":"74","author":"M. Hennessy","year":"1979","unstructured":"M. Hennessy, G.D. Plotkin, Full abstraction for a simple programming language, in: J. Becvar (Ed.), 8th Symp. on Math. Found. of Comput. Sci., Lecture Notes in Comput. Sci. 74 (Springer-Verlag, 1979) 108\u2013120.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/322077.322088","volume":"25","author":"C. A. R. R. Hoare","year":"1978","unstructured":"C.A.R. Hoare, Some properties of predicate transformers, J. ACM 25 (1978) 461\u2013480.","journal-title":"J. ACM"},{"key":"7_CR16","first-page":"44","volume":"1","author":"C. A. R. R. Hoare","year":"1981","unstructured":"C.A.R. Hoare, A calculus of total correctness for communicating processes, Sci. Comput. Progr. 1 (1981) 44\u201372.","journal-title":"Sci. Comput. Progr."},{"key":"7_CR17","volume-title":"Communicating Sequential Processes","author":"C. A. R. R. Hoare","year":"1985","unstructured":"C.A.R. Hoare, Communicating Sequential Processes (Prentice-Hall, London, 1985)."},{"key":"7_CR18","unstructured":"B. Jonsson, Compositional Verification of Distributed Systems, Ph.D. Thesis, Dept. Comput. Sci., Uppsala Univ., 1987."},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00266047","volume":"12","author":"P. E. Lauer","year":"1979","unstructured":"P.E. Lauer, P.R. Torrigiani, M.W. Shields, COSY \u2014 A system specification language based on paths and processes, Acta Inform. 12 (1979) 109\u2013158.","journal-title":"Acta Inform."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Concurrent program schemes and their interpretations, Tech. Report DAIMI PB-78, Aarhus Univ., 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"A.R. Meyer, K. Sieber, Towards fully abstract semantics for local variables, Preliminary Report, in: Proc. 15th ACM Symp. Principles of Program. Lang. (San Diego, California, 1988) 191\u2013203.","DOI":"10.1145\/73560.73577"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner, Fully abstract models of typed \u03bb-calculi, Theoret. Comput. Sci. 4 (1977) 1\u201322.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, Lecture Notes in Comput. Sci. 92 (Springer-Verlag, 1980).","DOI":"10.1007\/3-540-10235-3"},{"key":"7_CR24","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"J. Misra, K.M. Chandy, Proofs of networks of processes, IEEE Trans. Software Eng. 7 (1981) 417\u2013426.","journal-title":"IEEE Trans. Software Eng."},{"key":"7_CR25","unstructured":"E.-R. Olderog, Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship, Habilitationsschrift, Univ. Kiel, 1988\/89."},{"key":"7_CR26","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BFb0013035","volume":"354","author":"E.-R. Olderog","year":"1989","unstructured":"E.-R. Olderog, Strong bisimilarity on nets: a new cvoncept for comparing net semantics, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), Linear Time\/Branching Time\/Partial Order in the Semantics of Concurrency, Lecture Notes in Comput. Sci. 354 (Springer-Verlag, 1989) 549\u2013573.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"E.-R. Olderog, C.A.R. Hoare, Specification-oriented semantics for communicating processes, Acta Inform. 23 (1986) 9\u201366.","journal-title":"Acta Inform."},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/69575.2083","volume":"5","author":"M. Ossefort","year":"1983","unstructured":"M. Ossefort, Correctness proofs of communicating processes: three illustrative examples from the literature, ACM TOPLAS 5 (1983) 620\u2013640.","journal-title":"ACM TOPLAS"},{"key":"7_CR29","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"S. Owicki, L. Lamport, Proving liveness properties of concurrent programs, ACM TOPLAS 4 (1982) 199\u2013223.","journal-title":"ACM TOPLAS"},{"key":"7_CR30","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G.D. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977) 223\u2013255.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"W. Reisig, Petri Nets, An Introduction, EATCS Monographs on Theoret. Comput. Sci. (Springer-Verlag, 1985).","DOI":"10.1007\/978-3-642-69968-9"},{"key":"7_CR32","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-17943-7_118","volume":"258","author":"M. Rem","year":"1987","unstructured":"M. Rem, Trace theory and systolic computation, in: J.W. de Bakker, A.J. Nijman, P.C. Treleaven (Eds.), Proc. PARLE Conf., Eindhoven, Vol. 1, Lecture Notes in Comput. Sci. 258, (Springer-Verlag, 1987) 14\u201333.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"7_CR33","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(87)90023-7","volume":"34","author":"D. T. Sanella","year":"1987","unstructured":"D.T. Sanella, A. Tarlecki, On observational equivalence and algebraic specification, J. Comput. System Sci. 34 (1987) 150\u2013178.","journal-title":"J. Comput. System Sci."},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"J.L.A. van de Snepscheut, Trace Theory and VLSI Design, Lecture Notes in Comput. Sci. 200 (Springer-Verlag, 1985).","DOI":"10.1007\/BFb0031414"},{"key":"7_CR35","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling, Modal logics for communicating systems, Theoret. Comput. Sci. 49 (1987) 311\u2013347.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"J. Widom, D. Gries, F.B. Schneider, Completeness and incompleteness of trace-baced network proof systems, in: Proc. 14th ACM Symp. on Principles of Progr. Languages, M\u00fcnchen, 1987, 27\u201338.","DOI":"10.1145\/41625.41628"},{"key":"7_CR37","unstructured":"J. Zwiers, Compositionality, Concurrency and Partial correctness, Lecture Notes in Comput. Sci. 321 (Springer-Verlag, 1989)."},{"key":"7_CR38","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BFb0015776","volume":"194","author":"J. Zwiers","year":"1985","unstructured":"J. Zwiers, W.P. de Roever, P. van Emde-Boas, Compositionality and concurrent networks, in: W. Brauer (Ed.), Proc. 12th Coll. Automata, Languages and Programming, Lecture Notes in Comput. Sci. 194 (Springer-Verlag, 1985) 509\u2013519.","journal-title":"Lecture Notes in Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:20Z","timestamp":1605648080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}