{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:41Z","timestamp":1725662921678},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095101"},{"type":"electronic","value":"9783540351689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09510-1_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:42:42Z","timestamp":1330188162000},"page":"356-369","source":"Crossref","is-referenced-by-count":4,"title":["On reductions of parallel programs"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Kowalk","sequence":"first","affiliation":[]},{"given":"R\u00fcdiger","family":"Valk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(77)90041-X","volume":"5","author":"Y. S. Kwong","year":"1977","unstructured":"KWONG, Y. S., On Reduction of Asynchronous Systems, Theoretical Computer Science 5(1977), 25\u201350","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"29_CR2","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1145\/361227.361234","volume":"18","author":"R. J. Lipton","year":"1975","unstructured":"LIPTON, R. J., Reduction: A Method of Proving Peoperties of Parallel Programs, Comm. ACM 18(1975) 12, 717\u2013721","journal-title":"Comm. ACM"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"OWICKI, S., GRIES, P., An Axiomatic Proof Techniques for Parallel Programs I, Acta Informatica 6(1976), 319\u2013340","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09510-1_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:20Z","timestamp":1619557220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09510-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095101","9783540351689"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-09510-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2F3-540-09510-1_29', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>