S. Abramsky, S. Gay & R. Nagarajan (1996):
Interaction Categories and the Foundations of Typed Concurrent Programming.
In: M. Broy: Proceedings of the 1994 Marktoberdorf Summer Sxhool on Deductive Program Design.
Springer-Verlag,
pp. 35–113.
Rajeev Alur & David L. Dill (1994):
A Theory of Timed Automata.
Theoretical Computer Science 126,
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
R. Barbuti, C. Bernardeschi & N. De Francesco (2002):
Abstract interpretation of operational semantics for secure information flow.
Inf. Process. Lett. 83(2).
E. Clarke, D. Long & K. McMillan (1989):
Compositional model checking.
In: Proceedings of the Fourth Annual Symposium on Logic in computer science.
IEEE Press,
Piscataway, NJ, USA,
pp. 353–362,
doi:10.1109/LICS.1989.39190.
Vincent David, Jean Delcoigne, Evelyne Leret, Alain Ourghanlian, Philippe Hilsenkopf & Philippe Paris (1998):
Safety Properties Ensured by the OASIS Model for Safety Critical Real-Time Systems.
In: SAFECOMP.
E. Allen Emerson & Joseph Y. Halpern (1982):
Decision procedures and expressiveness in the temporal logic of branching time.
In: Proceedings of the fourteenth annual ACM symposium on Theory of computing,
STOC '82.
ACM,
New York, NY, USA,
pp. 169–180,
doi:10.1145/800070.802190.
Esfandiar Haghverdi, Paulo Tabuada & George J. Pappas (2005):
Bisimulation relations for dynamical, control, and hybrid systems.
Theor. Comput. Sci. 342,
pp. 229–261,
doi:10.1016/j.tcs.2005.03.045.
N. Halbwachs, P. Caspi, P. Raymond & D. Pilaud (1991):
The synchronous dataflow programming language Lustre.
Proceedings of the IEEE 79(9),
pp. 1305–1320,
doi:10.1109/5.97300.
Xavier Leroy & Hervé Grall (2008):
Coinductive big-step operational semantics.
Available at http://arxiv.org/abs/0808.0586.
Edward F. Moore (1956):
Gedanken Experiments on Sequential Machines.
In: Automata Studies.
Princeton U.,
pp. 129–153.
Mike Stannett (2006):
Simulation testing of automata.
Formal Aspects of Computing 18,
pp. 31–41.
10.1007/s00165-005-0080-y.
eptcs@eptcs.org