{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:51:20Z","timestamp":1725562280492},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220947"},{"type":"electronic","value":"9783540247739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24773-9_16","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T04:08:27Z","timestamp":1280894907000},"page":"218-233","source":"Crossref","is-referenced-by-count":0,"title":["Modeling Discretely Timed Systems Using Different Magnitudes of Non-standard Reals"],"prefix":"10.1007","author":[{"given":"Heinrich","family":"Rust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR2","unstructured":"Beauquier, D., Slissenko, A.: On semantics of algorithms with continuous time. Technical Report 97-15, Universit\u00e9 de Paris 12 - Val de Marne (October 1997)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/BFb0030597","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"D. Beauquier","year":"1997","unstructured":"Beauquier, D., Slissenko, A.: The railroad crossing problem: Towards semantics of timed algorithms and their model checking in high level languages. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 202\u2013212. Springer, Heidelberg (1997)"},{"key":"16_CR4","unstructured":"Berry, G.: The constructive semantics of pure ESTEREL. Draft version 2.0. Technical report, Centre de Math\u00e9matiques Appliqu\u00e9es, Ecole des Mines de Paris (1996)"},{"key":"16_CR5","first-page":"148","volume-title":"FBT 1998: Formale Beschreibungstechniken f\u00fcr verteilte Systeme","author":"D. Beyer","year":"1998","unstructured":"Beyer, D., Rust, H.: Modeling a production cell as a distributed real-time system with cottbus timed automata. In: K\u00f6nig, H., Langend\u00f6rfer, P. (eds.) FBT 1998: Formale Beschreibungstechniken f\u00fcr verteilte Systeme, pp. 148\u2013159. Shaker Verlag, Aachen (1998)"},{"key":"16_CR6","unstructured":"Gurevich, Y.: Logic and the challenge of computer science. In: B\u00f6rger, E. (ed.) Current Trends in Theoretical Computer Science, pp. 1\u201357. Computer Science Press (1988)"},{"key":"16_CR7","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)"},{"key":"16_CR8","unstructured":"Gurevich, Y.: May 1997 draft of the ASM guide. Technical Report CSE-TR-337-97, University of Michigan, EECS Department (1997)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-61377-3_43","volume-title":"Computer Science Logic","author":"Y. Gurevich","year":"1996","unstructured":"Gurevich, Y., Huggins, J.K.: The railroad crossing problem: An experiment with instantaneous actions and immediate reactions. In: Kleine B\u00fcning, H. (ed.) CSL 1995. LNCS, vol.\u00a01092, pp. 266\u2013290. Springer, Heidelberg (1996)"},{"key":"16_CR10","first-page":"295","volume-title":"Specification and Validation Methods","author":"Y. Gurevich","year":"1995","unstructured":"Gurevich, Y., Mani, R.: Group membership protocol: Specification and verification. In: B\u00f6rger, E. (ed.) Specification and Validation Methods, pp. 295\u2013328. Oxford University Press, Oxford (1995)"},{"issue":"9","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N. Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Pilaud, D.: The synchronous dataflow programming language lustre. Proceedings of the IEEE\u00a079(9), 1305\u20131320 (1991)","journal-title":"Proceedings of the IEEE"},{"key":"16_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2231-4","volume-title":"Synchronous Programming of Reactive Systems","author":"N. Halbwachs","year":"1993","unstructured":"Halbwachs, N.: Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming\u00a08, 231\u2013274 (1987)","journal-title":"Science of Computer Programming"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Lipsett, R.: Erich Marschner, and Moe Shahdad. VHDL\u2013the language. In: IEEE Design and Test, pp. 28\u201341 (1986)","DOI":"10.1109\/MDT.1986.294900"},{"key":"16_CR15","first-page":"1165","volume":"83","author":"E. Nelson","year":"1977","unstructured":"Nelson, E.: Internal set theory, a new approach to nonstandard analysis. Bulletin American. Mathematical Society\u00a083, 1165\u20131198 (1977)","journal-title":"Mathematical Society"},{"key":"16_CR16","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884223","volume-title":"Non-standard Analysis","author":"A. Robinson","year":"1996","unstructured":"Robinson, A.: Non-standard Analysis. Princeton University Press, Princeton (1996)"},{"key":"16_CR17","unstructured":"Rust, H.: Hybrid abstract state machines: Using the hyperreals for describing continuous changes in a discrete notation. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds.) Abstract State Machines\u2014ASM 2000, pp. 341\u2013356. ETH, Z\u00fcrich (2000); TIK-Report Nr. 87"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Rust, H.: Modelling the generalized railway crossing with hybrid abstract state machines. In: Schnieder, E., Becker, U. (eds.) Proceedings of the 9th IFAC Symposium Control in Transportantion Systems 2000, Braunschweig, June 2000, vol.\u00a02, pp. 281\u2013288 (2000)","DOI":"10.1016\/S1474-6670(17)38155-7"}],"container-title":["Lecture Notes in Computer Science","Abstract State Machines 2004. Advances in Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24773-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:13Z","timestamp":1605761773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24773-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220947","9783540247739"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24773-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}