Lecture Notes in Computer Science 3472

Literature 635
[JG90] F. Jahanian and A. Goyal. A formalism for monitoring real-time constraints
at run-time. In Proceedings of the 20th International Symposium on Fault-
Tolerant Computing Systems (FTCS 1990), pages 148–155, 1990. [531]
[JGL91] Bengt Jonsson and Kim Guldstrand Larsen. Specification and refinement
of probabilistic processes. In Proceedings of the 6th IEEE International
Symposium on Logic in Computer Science (LICS 1991), pages 266–277.
IEEE Computer Society Press, 1991. [234, 269]
[JJ02] Claude Jard and Thierry Jéron. TGV: Theory, principles and algorithms. In
Proceedings of the 6th World Conference on Integrated Design and Process
Technology (IDPT 2002). Society for Design and Process Science, June
2002. [417, 420]
[Jon91] Bengt Jonsson. Simulations between specifications of distributed systems.
In Proceedings of the 2nd International Conference on Concurrency Theory
(CONCUR 1991), volume 527 of Lecture Notes in Computer Science, pages
346–360. Springer-Verlag, 1991. [256, 269]
[JUn] JUnit. http://www.junit.org/. [501]
[JY95] Bengt Jonsson and Wang Yi. Compositional testing preorders for probabilistic
processes. In Proceedings of the 10th IEEE International Symposium
on Logic in Computer Science (LICS 1995), pages 431–441. IEEE Computer
Society Press, 1995. [234, 252, 255, 265]
[JY02] Bengt Jonsson and Wang Yi. Testing preorders for probabilistic processes
can be characterized by simulations. Theoretical Computer Science,
282(1):33–51, 2002. [234, 244, 245, 252, 255, 256, 265, 269]
[Kar03] Jarkko Kari. Synchronizing finite automata on eulerian digraphs. Theoretical
Computer Science, 295(1–3):223–232, 2003. [31, 32]
[KCS98] K. Narayan Kumar, Rance Cleaveland, and Scott Smolka. Infinite probabilistic
and non-probabilistic testing. In Proceedings of the 18th Conference
on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 1998), volume 1530 of Lecture Notes in Computer Science, pages
209–220. Springer-Verlag, 1998. [234, 244]
[Kel76] Robert M. Keller. Formal verification of parallel programs. Commun. ACM,
19(7):371–384, 1976. [113]
[Kfo70] Denis J. Kfoury. Synchronizing sequences for probabilistic automata. Studies
in Applied Mathematics, 49(1):101–103, March 1970. [32]
[KGHS98] B. Koch, J. Grabowski, D. Hogrefe, and M. Schmitt. AutoLink – a tool for
automatic test generation from SDL specifications. In Proceedings of the
IEEE International Workshop on Industrial Strength Formal Specification
Techniques (WIFT 1998), October 1998. [431, 432, 433]
[KHMP94] Arjun Kapun, Thomas A. Henzinger, Zohar Manna, and Amir Pnueli.
Proving safety properties of hybrid systems. In Hans Langmaack, Willem P.
de Roever, and Jan Vytopil, editors, Proceedings of the 3rd International
Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
(FTRTFT 1994), volume 863 of Lecture Notes in Computer Science,
pages 431–454. Springer-Verlag, 1994. [375]
[Kin76] James C. King. Symbolic execution and program testing. Communications
of the ACM, 19(7):385–394, July 1976. [338, 342]
[KJG99] A. Kerbrat, T. Jéron, and R. Groz. Automated test generation from SDL
specifications. In R. Dssouli, G. von Bochmann, and Y. Lahav, editors,
The Next Millennium – Proceedings of the 9th SDL Forum, 1999), pages
135–152. Elsevier Science Publishers, 1999. [419, 420]