{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:54:51Z","timestamp":1725576891453},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205388"},{"type":"electronic","value":"9783540400226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40022-6_21","type":"book-chapter","created":{"date-parts":[[2011,1,27]],"date-time":"2011-01-27T14:15:31Z","timestamp":1296137731000},"page":"430-454","source":"Crossref","is-referenced-by-count":2,"title":["Concurrency Based Transition Refinement for the Verification of Distributed Algorithms"],"prefix":"10.1007","author":[{"given":"Sibylle","family":"Peuker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters\u00a021, 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR3","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06289-0","volume-title":"Coloured Petri Nets","author":"K. Jensen","year":"1992","unstructured":"Jensen, K.: Coloured Petri Nets. EATCS Monographs on Theoretical Computer Science, vol.\u00a01. Springer, Heidelberg (1992)"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/FI-1999-37306","volume":"37","author":"E. Kindler","year":"1999","unstructured":"Kindler, E., Peuker, S.: Integrating distributed algorithms into distributed systems. Fundamenta Informaticae\u00a037, 291\u2013309 (1999)","journal-title":"Fundamenta Informaticae"},{"key":"21_CR5","first-page":"16","volume":"51","author":"E. Kindler","year":"1996","unstructured":"Kindler, E., Reisig, W.: Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter\u00a051, 16\u201331 (1996)","journal-title":"Petri Net Newsletter"},{"issue":"1-2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0304-3975(00)00205-X","volume":"262","author":"E. Kindler","year":"2001","unstructured":"Kindler, E., V\u00f6lzer, H.: Algebraic nets with flexible arcs. Theoretical Computer Science\u00a0262(1-2), 285\u2013310 (2001)","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/CSD.2001.981766","volume-title":"International Conference on Application of Concurrency to System Design","author":"S. Peuker","year":"2001","unstructured":"Peuker, S.: Property preserving transition refinement with concurrent runs: An example. In: International Conference on Application of Concurrency to System Design, pp. 77\u201386. IEEE Computer Society, Los Alamitos (2001)"},{"key":"21_CR8","unstructured":"Peuker, S.: Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen. PhD thesis, Humboldt-Universit\u00e4t zu Berlin (2001), available via, http:\/\/dochost.rz.hu-berlin.de\/abstract.php3\/dissertationen\/peuker-sibylle-2001-07-03"},{"key":"21_CR9","series-title":"LNCS","volume-title":"Proceedings of Petri Nets 2002","author":"S. Peuker","year":"2002","unstructured":"Peuker, S.: Deriving a distributed minimum weight spanning tree algorithm with transition refinement for Algebraic Petri nets. In: Proceedings of Petri Nets 2002. LNCS. Springer, Heidelberg (2002) (to appear)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Padberg, J., Hoffman, K., Gajewski, M.: Introduction and preservation of safety properties in algebraic high-level net systems. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol.\u00a01783, pp. 249\u2013265. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-46428-X_18"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(91)90203-E","volume":"80","author":"W. Reisig","year":"1991","unstructured":"Reisig, W.: Petri Nets and Algebraic Specifications. Theoretical Computer Science\u00a080, 1\u201334 (1991)","journal-title":"Theoretical Computer Science"},{"key":"21_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03687-7","volume-title":"Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets","author":"W. Reisig","year":"1998","unstructured":"Reisig, W.: Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer, Heidelberg (1998)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0022-0000(79)90050-3","volume":"18","author":"R. Valette","year":"1979","unstructured":"Valette, R.: Analysis of Petri Nets by stepwise refinement. Journal of Computer and System Sciences\u00a018, 35\u201346 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-52559-9_68","volume-title":"Stepwise Refinement of Distributed Systems","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol.\u00a0430, pp. 267\u2013300. Springer, Heidelberg (1990)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-17218-1_51","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Vogler","year":"1987","unstructured":"Vogler, W.: Behaviour preserving refinements of Petri nets. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol.\u00a0246, pp. 82\u201393. Springer, Heidelberg (1987)"},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/362575.362577","volume":"14","author":"N. Wirth","year":"1971","unstructured":"Wirth, N.: Program development by stepwise refinement. Communications of the ACM\u00a014(4), 221\u2013227 (1971)","journal-title":"Communications of the ACM"},{"key":"21_CR17","unstructured":"Weber, M., Walter, R., V\u00f6lzer, H., Vesper, T., Reisig, W., Peuker, S., Kindler, E., Freiheit, J., Desel, J.: DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 88, Humboldt- Universit\u00e4t zu Berlin (December 1997)"}],"container-title":["Lecture Notes in Computer Science","Petri Net Technology for Communication-Based Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40022-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T02:14:25Z","timestamp":1592273665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40022-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205388","9783540400226"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40022-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}