{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:44Z","timestamp":1725663224557},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156482"},{"type":"electronic","value":"9783540395270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15648-8_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:20:46Z","timestamp":1330176046000},"page":"237-254","source":"Crossref","is-referenced-by-count":3,"title":["Behavior: a temporal appreach to process modeling"],"prefix":"10.1007","author":[{"given":"Van","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Demers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Owicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"K.R. Apt","year":"1981","unstructured":"Apt, K.R., Ten years of Hoare's logic: a survey \u2014 Part 1, ACM TOPLAS, vol. 3, no. 4, Oct 1981, 431\u2013483.","journal-title":"ACM TOPLAS"},{"doi-asserted-by":"crossref","unstructured":"Barringer, H., Kuiper, R. and Pnueli, A., Now you may compose temporal logic specifications, 16th ACM Symposium on the Theory of Computing, May 1984.","key":"19_CR2","DOI":"10.1145\/800057.808665"},{"doi-asserted-by":"crossref","unstructured":"Brock, J.D. and Ackerman, W.B., Scenarios: a model of non-determinate computation, International Colloquium on Formalization of Programming Concepts, April 1981.","key":"19_CR3","DOI":"10.1007\/3-540-10699-5_102"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-12896-4_356","volume":"164","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., A semantics and proof system for communicating processes, Lecture Notes in Computer Science, vol. 164, 1984, 68\u201385.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Harel, D., First-order dynamic logic, Lecture Notes in Computer Science, vol. 68, 1979.","key":"19_CR5","DOI":"10.1007\/3-540-09237-4"},{"key":"19_CR6","first-page":"144","volume":"25","author":"D. Harel","year":"1982","unstructured":"Harel, D., Kozen, D. and Parikh, R., Process logic: expressiveness, decidability and completeness, JCSS vol. 25(1982), 144\u2013170.","journal-title":"JCSS"},{"key":"19_CR7","first-page":"987","volume":"77","author":"C. Hewitt","year":"1977","unstructured":"Hewitt, C. and Baker, H.G., Laws for communicating parallel processes, IFIP 77, 1977, 987\u2013992.","journal-title":"IFIP"},{"issue":"8","key":"19_CR8","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R., Communicating sequential processes, Communications of the ACM, vol. 21, no. 8, Aug 1978, 666\u2013677.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R., Notes on communicating sequential processes, Technical Monograph PRG-33, Programming Research Group, Oxford University Computing Laboratory, Aug 1983.","key":"19_CR9","DOI":"10.1007\/978-3-662-09507-2_19"},{"key":"19_CR10","first-page":"993","volume":"77","author":"G. Kahn","year":"1977","unstructured":"Kahn, G. and MacQueen, D.B., Coroutines and networks of parallel processes, IFIP 77, 1977, 993\u2013998.","journal-title":"IFIP"},{"doi-asserted-by":"crossref","unstructured":"Lamport, L., What good is temporal logic? Proceedings IFIP 1983, 657\u2013668.","key":"19_CR11","DOI":"10.1145\/2402.322398"},{"doi-asserted-by":"crossref","unstructured":"Manna, Z. and Pnueli, A., Verification of concurrent programs, Part 1: The temporal framework, Technical report STAN-CS-81-836, Stanford University, June 1981.","key":"19_CR12","DOI":"10.21236\/ADA106750"},{"doi-asserted-by":"crossref","unstructured":"Manna, Z. and Pnueli, A., How to cook a temporal proof system for your pet language, 10th Annual ACM Symposium on Principles of Programming Languages, Jan 1983, 141\u2013154.","key":"19_CR13","DOI":"10.1145\/567067.567082"},{"doi-asserted-by":"crossref","unstructured":"Milner, R., A calculus of communicating systems, Lecture Notes in Computer Science, vol. 92, 1980.","key":"19_CR14","DOI":"10.1007\/3-540-10235-3"},{"unstructured":"Nguyen, V., A theory of processes, Ph.D. Thesis, Department of Computer Science, Cornell University (in preparation).","key":"19_CR15"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, V., Gries, D. and Owicki, S., A model and temporal proof system for networks of processes, 12th ACM Symposium on Principles of Programming Languages, Jan 1985, 121\u2013131.","key":"19_CR16","DOI":"10.1145\/318593.318624"},{"doi-asserted-by":"crossref","unstructured":"Pratt, V., On the composition of processes, 9th ACM Symposium on Principles of Programming Languages, Jan 1982, 213\u2013223.","key":"19_CR17","DOI":"10.1145\/582153.582177"},{"issue":"1","key":"19_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF03037020","volume":"1","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E. and Takeuchi, A., Object-oriented programming in Concurrent Prolog, Journal of new generation computing, vol. 1, no. 1, 1983, 25\u201348.","journal-title":"Journal of new generation computing"}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15648-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:08:34Z","timestamp":1605625714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15648-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156482","9783540395270"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-15648-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}