{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:49Z","timestamp":1725663049909},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184195"},{"type":"electronic","value":"9783540479604"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18419-8_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:24Z","timestamp":1330198464000},"page":"199-230","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On axiomatic defintion of max-model of concurrency"],"prefix":"10.1007","author":[{"given":"Grazyna","family":"Mirkowska","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Salwicki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/357103.357110","volume":"2","author":"K.R. Apt","year":"1980","unstructured":"Apt K.R., Francez N., de Roever W.P., A Proof System for Communicating Sequential Processes, ACM TOPLAS, vol.2,No.3 (1980), 361\u2013385","journal-title":"ACM TOPLAS"},{"doi-asserted-by":"crossref","unstructured":"Best E., Devillers R., Concurrent Behaviour: Sequences, Processes and Programming Languages, GMD-Studien No.99 (1985)","key":"8_CR2","DOI":"10.1007\/3-540-15670-4_11"},{"key":"8_CR3","first-page":"273","volume":"176","author":"P. Enjalbert","year":"1984","unstructured":"Enjalbert P., Michel M., Many-sorted Temporal Logic for Multiprocesses Systems, Proc. MFCS'84 (Chytil M. and Koubek V. eds) in LNCS 176, 1984, 273\u2013282","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Floyd R.W., Assigning Meanings to Programs, Proc.AMS (1967)","key":"8_CR4","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"8_CR5","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, CACM 21 (1978), 666\u2013677","journal-title":"CACM"},{"doi-asserted-by":"crossref","unstructured":"Kripke S., Semantical analysis of modal logic II. The theory of Models, Amsterdam North-Holland 1965","key":"8_CR6","DOI":"10.1016\/S0049-237X(08)71685-9"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/2993.357247","volume":"6","author":"L. Lamport","year":"1984","unstructured":"Lamport L., Schneider F., The \"Hoare Logic\" of CSP and All That, TOPLAS 6 (1984), 281\u2013295","journal-title":"TOPLAS"},{"unstructured":"Mirkowska G., Salwicki A., Algorithmic Logic, Warsaw, PWN-Reidel Publ. (1987)","key":"8_CR8"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki S., Gries D., An Axiomatic Proof Technique for Parallel Programs, Acta Informatica 6 (1976), 319\u2013340","journal-title":"Acta Informatica"},{"key":"8_CR10","first-page":"169","volume":"125","author":"A. Salwicki","year":"1981","unstructured":"Salwicki A., Muldner T., On Algorithmic Properties of Concurrent Programs, in Logics of programs, Zurich 1979 (E.Engeler ed.) LNCS 125 (1981) Springer-Verlag, 169\u2013197","journal-title":"LNCS"},{"unstructured":"de Roever W.P., The quest for compositionality \u2014 a survey of assertionbased Proof Systems for Concurrent Programs, Part I: Concurrency Based on Shared Variables, Proc. of the IFIP Working Conf. 1985 \"The Role of Abstract Models in Computer Science\" (E. J.Neuhold ed.) North-Holland","key":"8_CR11"}],"container-title":["Lecture Notes in Computer Science","Mathematical Models for the Semantics of Parallelism"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18419-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T03:27:56Z","timestamp":1593746876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18419-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184195","9783540479604"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-18419-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}