Formal verification of statecharts with instantaneous chain reactions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1217, Issue , 1997, Pages 224-238

  Philipps, Jan ^a   Scholz, Peter ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL VERIFICATION; SPECIFICATIONS; TEMPORAL LOGIC;

BROADCAST COMMUNICATION; CHAIN REACTION; MU-CALCULUS; STATECHARTS; SYMBOLIC MODEL CHECKING; TEMPORAL SPECIFICATION; TRIGGER CONDITIONS;

MODEL CHECKING;

EID: 33645294232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035391     Document Type: Conference Paper

References (19)

1. G. Berry. Real Time Programming: Special Purpose or General Purpose Languages. Information Processing 89, 1989.
2. G Berry and G. Gonthier. The ESTERJEL Synchronous Programming Language: Design, Semantics, Implementation. Technical Report 842, INRIA, 1988.
3. A. Biere. Eine Methode zur/i-Kalkül-Modellprüfung. Slides for the AKFM from 23.05.96, GI/ITG-Fachgesprach "Formale Beschreibungstechniken für verteilte Systeme" (in German), 1996.
4. D. Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming, 8:231 - 274, 1987.
5. J. J. M. Hooman, S. Ramesh, and W. P. de Roever. A Compositional Axiomatization of Statecharts. Theoretical Computer Science, 101:289 - 335, 1992.
6. C. Huizing and W. -P. de Roever. Introduction to Design Choices in the Semantics of Statecharts. Information Processing Letters, 37, 1991.
7. i-Logix Inc., 22 Third Avenue, Burlington, Mass. 01803, U. S. A. Languages of Statemate, 1990.
8. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding Negation as Failure into a Model Generation Theorem Prover. In D. Kapur, editor, CADE-11, number 607 in Lecture Notes in Artificial Intelligence, pages 400-415, 1992.
9. F. Maraninchi. Operational and Compositional Semantics of Synchronous Automaton Compositions, volume 630 of Lecture Notes in Computer Science, pages 550 - 564. Springer-Verlag, 1992.
10. F. Maraninchi and N. Halbwachs. Compositional Semantics of Non-deterministic Synchronous Languages. ESOP’96, 1996.
11. D. Nazareth, F. Regensburger, and P. Scholz. Mini-Statecharts: A Lean Version of Statecharts. Technical Report TUM-I9610, Technische Universitat München, D-80290 München, 1996.
12. J. Philipps and P. Scholz. The Tao of Statecharts. 1996. To appear in: TAP-SOFT’97.
13. J. Philipps and T. Yoneda. Symbolic Model Checking of Statecharts. Technical Report FTS-95-37, IEICE, 1995.
14. A. Pnueli and M. Shalev. What is in a Step: On the Semantics of Statecharts. In T. Ito and A. R. Meyer, editors, Proceedings of the "Theoretical Aspects in Computer Software 91", volume 526 of Lecture Notes in Computer Science, pages 244 - 264. Springer-Verlag, 1991.
15. P. Scholz. An Extended Version of Mini-Statecharts. Technical Report TUM-I9628, Technische Universitat München, D-80290 München, 1996.
16. P. Scholz. A Light-Weight Formalism for the Specification of Reactive Systems. 1996. SOFSEM’96.
17. P. Scholz, D. Nazareth, and F. Regensburger. Mini-Statecharts: A Compositional Way to Model Parallel Systems. 1996. PDCS’96.
18. M. von der Beeck. A Comparison of Statecharts Variants, volume 863 of Lecture Notes in Computer Science, pages 128 - 148. Springer, 1994.
19. L. Wall and R. L. Schwartz. Programming in peri. Cari Hanser, 1993.