Lecture Notes in Computer Science 3472

Literature 647
[SL94] Roberto Segala and Nancy Lynch. Probabilistic simulations for probabilistic
processes. In Bengt Jonsson and Joachim Parrow, editors, Proceedings of the
5th Conference on Concurrency Theory (CONCUR 1994), volume 836 of
Lecture Notes in Computer Science, pages 481–496. Springer-Verlag, 1994.
[239, 269]
[SM93] Sriram Sankar and Manas Mandal. Concurrent runtime monitoring of formally
specified programs. IEEE Computer, 26(3):32–41, March 1993. [531]
[SMIM89] F. Sato, J. Munemori, T. Ideguchi, and T. Mizuno. Test sequence generation
method based on finite automata – single transition checking using W Set.
Transactions of EIC (in Japanese), J72-B-I(3):183–192, 1989. [93]
[Sok71] M. N. Sokolovskii.
6:44–49, 1971. [40]
Diagnostic experiments with automata. Kibernetika,
[Sos92] R. Sosič. Dynascope: A tool for program directing. In Proceedings of the
SIGPLAN Conference on Programming Language Design and Implementation
(PLDI 1992), pages 12–21, 1992. Appeared in SIGPLAN Notices,
volume 27(7), July 1992. [531]
[SPHP02] B. Schätz, A. Pretschner, F. Huber, and J. Philipps. Model-based development
of embedded systems. In J.-M. Bruel and Z. Bellahsene, editors, Proceedings
of the Workshops of the 8th International Conference on Advances
in Object-Oriented Information Systems (OOIS 2002), volume 2426 of Lecture
Notes in Computer Science, pages 298–311. Springer-Verlag, 2002. [290]
[Spi92] J. Michael Spivey. The Z Notation. Prentice Hall, second edition, 1992.
[325, 327]
[SSD + 03] U. Sammapun, R. Sharykin, M. DeLap, M. Kim, and S. Zdancewic. Formalizing
Java-MaC. In O. Sokolsky and M. Viswanathan, editors, Proccedings
of the 3rd Workshop on Run-Time Verification (RV 2003), volume 89(2)
of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers,
2003. [526, 547]
[Sta] Stateflow. http://www.mathworks.com/products/stateflow/. [1]
[Sta66] Peter H. Starke. Eine Bemerkung über homogene Experimente. Elektronische
Informationverarbeitung und Kybernetic, 2:257–259, 1966. [31]
[Sta72] Peter. H. Starke. Abstract Automata. North-Holland, Amsterdam, 1972.
Translation from German. [8, 15]
[Sta73] H. Stachowiak. Allgemeine Modelltheorie. Springer-Verlag, 1973. [283, 288]
[Sto02] M. I. A. Stoelinga. An introduction to probabilistic automata. In G. Rozenberg,
editor, EATCS bulletin, volume 78, pages 176–198, 2002. [234]
[SV03] M. I. A. Stoelinga and F. W. Vaandrager. A testing scenario for probabilistic
automata. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J.
Woeginger, editors, Proceedings of the 30th International Colloquium on
Automata, Lnaguages, and Programming (ICALP 2003), volume 2719 of
Lecture Notes in Computer Science, pages 464–477. Springer-Verlag, 2003.
Also published as Technical Report of the nijmeegs instituut voor informatica
en informatiekunde, number NIII-R0307. [234, 269]
[SVD01] Jan Springintveld, Frits Vaandrager, and Pedro R. D’Argenio. Testing
timed automata. Theoretical Computer Science, 254(1–2):225–257, March
2001. [202, 206, 212, 215, 221, 230]