Modeling Discretely Timed Systems Using Different Magnitudes of Non-standard Reals
暂无分享,去创建一个
[1] Nicolas Halbwachs,et al. Synchronous Programming of Reactive Systems , 1992, CAV.
[2] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[3] Roger Lipsett,et al. VHDL - The Language , 1986, IEEE Design & Test of Computers.
[4] Pascal Raymond,et al. The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.
[5] Yuri Gurevich,et al. Group membership protocol: specification and verification , 1995, Specification and validation methods.
[6] Yuri Gurevich,et al. Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.
[7] Dirk Beyer,et al. Modeling a Production Cell as a Distributed Real-Time System with Cottbus Timed Automata , 1998, FBT.
[8] Egon Börger. Specification and validation methods , 1995 .
[9] Danièle Beauquier,et al. The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages , 1997, TAPSOFT.
[10] Donald Sanella. What Does the Future Hold for Theoretical Computer Science , 1997 .
[11] Heinrich Rust. MODELLING THE GENERALIZED RAILWAY CROSSING WITH HYBRID ABSTRACT STATE MACHINES. , 2000 .
[12] A. Robinson. Non-standard analysis , 1966 .
[13] Yuri Gurevich,et al. The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions , 1995, CSL.
[14] Edward Nelson. Internal set theory: A new approach to nonstandard analysis , 1977 .
[15] David Harel,et al. Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..
[16] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..