Abstract
We have introduced and demonstrated a verification formalism briefly which explicitly deals with the rational time. The proof (and its verification formalism) of the example is easy and intuitive, for the conventional mathematics is used directly. The entire system of SOFA and the formal proof on FA of this example will appear elsewhere.
References
Igarashi, S.: The (ν-conversion and an analytic semantics, in Mason, R. E. A. (ed.), Inf. Proc. 83 (1983), pp. 769–774.
Takeuti, G.: Two applications of logic to mathematics, Princeton University Press (1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Igarashi, S., Mizutani, T., Shirogane, T., Shio, M. (1996). Formal analysis for continuous systems controlled by programs. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027812
Download citation
DOI: https://doi.org/10.1007/BFb0027812
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62031-0
Online ISBN: 978-3-540-49626-7
eBook Packages: Springer Book Archive