{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:59Z","timestamp":1725543419692},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114465"},{"type":"electronic","value":"9783642114472"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11447-2_4","type":"book-chapter","created":{"date-parts":[[2010,1,8]],"date-time":"2010-01-08T14:47:12Z","timestamp":1262962032000},"page":"50-64","source":"Crossref","is-referenced-by-count":6,"title":["An ASM-Characterization of a Class of Distributed Algorithms"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Glausch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Reisig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/937555.937561","volume":"4","author":"A. Blass","year":"2003","unstructured":"Blass, A., Gurevich, Y.: Abstract State Machines Capture Parallel Algorithms. ACM Trans. Comput. Logic\u00a04(4), 578\u2013651 (2003)","journal-title":"ACM Trans. Comput. Logic"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, parts I, II, III. ACM Trans. Comput. Logic (2006)","DOI":"10.1145\/1131313.1131320"},{"key":"4_CR3","unstructured":"Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: General Interactive Small Step Algorithms. Technical Report MSR-TR-2005-113, Microsoft Research (August 2006)"},{"key":"4_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-18216-7","volume-title":"Abstract State Machines: A Method for High-Level System Design and Analysis","author":"E. B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E., St\u00e4rk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)"},{"key":"4_CR5","unstructured":"Glausch., A., Reisig, W.: Distributed Abstract State Machines and Their Expressive Power, Humboldt-Universit\u00e4t zu, Berlin. Informatik-Berichte, vol.\u00a0196 (2006), http:\/\/www.informatik.hu-berlin.de\/top\/download\/publications\/GlauschR2006_hub_tr196.pdf"},{"key":"4_CR6","first-page":"9","volume-title":"Specification and Validation Methods","author":"Y. Gurevich","year":"1995","unstructured":"Gurevich, Y.: Evolving Algebras 1993: Lipari Guide. In: B\u00f6rger, E. (ed.) Specification and Validation Methods, pp. 9\u201336. Oxford University Press, Oxford (1995)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic\u00a01(1), 77\u2013111 (2000)","journal-title":"ACM Transactions on Computational Logic"},{"key":"4_CR8","unstructured":"Gurevich, Y., Yavorskaya, T.: On Bounded Exploration and Bounded Nondeterminism. Technical Report MSR-TR-2006-07, Microsoft Research (January 2006)"},{"key":"4_CR9","unstructured":"ITU-T. SDL Formal Semantics Definition. ITU-T Recommendation Z.100 Annex F, International Telecommunication Union (November 2000)"},{"key":"4_CR10","unstructured":"Petri, C.A.: Non-Sequential Processes. Interner Bericht ISF\u201377\u20135, Gesellschaft f\u00fcr Mathematik und Datenverarbeitung (1977)"},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer-Verlag New York, Inc., New York (1985)"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00236-002-0106-3","volume":"39","author":"W. Reisig","year":"2003","unstructured":"Reisig, W.: On Gurevich\u2019s Theorem on Sequential Algorithms. Acta Informatica\u00a039(5), 273\u2013305 (2003)","journal-title":"Acta Informatica"},{"key":"4_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59495-3","volume-title":"Java and the Java Virtual Machine: Definition, Verification, Validation","author":"R. St\u00e4rk","year":"2001","unstructured":"St\u00e4rk, R., Schmid, J., B\u00f6rger, E.: Java and the Java Virtual Machine: Definition, Verification, Validation. Springer, Heidelberg (2001)"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modeling Concurrency with Partial Orders. Int. J. of Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"Int. J. of Parallel Programming"}],"container-title":["Lecture Notes in Computer Science","Rigorous Methods for Software Construction and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11447-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:45Z","timestamp":1606185645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11447-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642114465","9783642114472"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11447-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}