Gerald Lüttgen
Michael Mendler
Skip Abstract Section
Abstract
The semantics of Statecharts macro steps, as introduced by Pnueli and Shalev [1991], lacks compositionality. This article first analyzes the compositionality problem and traces it back to the invalidity of the Law of the Excluded Middle. It then characterizes the semantics via a particular class of linear intuitionistic Kripke models. This yields, for the first time in the literature, a simple fully abstract semantics that interprets Pnueli and Shalev's concept of failure naturally. The results not only give insight into the semantic subtleties of Statecharts, but also provide a basis for an implementation, for developing algebraic theories for macro steps, and for comparing different Statecharts variants.
- ALUR, R., KANNAN,S.,AND YANNAKAKIS, M. 1999. Communicating hierarchical state machines. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP '99) (Prague, Czech Republic). P. van Emde Boas, J. Wiedermann, and M. Nielsen, Eds. Lecture Notes in Computer Science, vol. 1644. Springer-Verlag, New York, pp. 169-178.]] Google Scholar
Digital Library
- BERRY, G. 1999. The constructive semantics of pure ESTEREL. Draft Version 3.0. Available at http://www-sop.inria.fr/meije/Personnel/Gerard.Berry.html.]]Google Scholar
- BERRY, G. 2000. The foundations of ESTEREL.InProof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling, and M. Tofte, Eds. Foundations of Computing MIT Press, Cambridge, Mass.]] Google ScholarDigital Library
- BERRY,G.AND SENTOVICH, E. 2000. An implemenatation of constructive synchronous programs in POLIS. Form. Meth. Syst. Des. 17, 2 (Oct.), 135-161.]] Google ScholarDigital Library
- BOOCH, G., RUMBAUGH,J.,AND JACOBSON, I. 1998. The Unified Modeling Language User Guide. Object Techn. Series. Addison Wesley Longman, Reading, Mass.]] Google ScholarDigital Library
- BROY, M. 1997. Abstract semantics of synchronous languages: The example ESTEREL. Tech. Rep. TUM-I9706. Munich Univ. of Tech., Munich, Germany.]]Google Scholar
- DAMM, W., JOSKO, B., HUNGAR, H., AND PNUELI, A. 1997. A compositional real-time semantics of STATEMATE designs. In Compositionality: The Significant Difference (Bad Malente, Germany). W. de Roever, H. Langmaack, and A. Pnueli, Eds. Lecture Notes in Computer Science, vol. 1536. Springer-Verlag, New York, pp. 186-238.]] Google ScholarDigital Library
- HAREL, D. 1987. Statecharts: A visual formalism for complex systems. Sci. Comput. Program. 8, 231-274.]] Google ScholarDigital Library
- HAREL,D.AND NAAMAD, A. 1996. The STATEMATE semantics of Statecharts. ACM Trans. Softw. Eng. 5, 4 (Oct.), 293-333.]] Google ScholarDigital Library
- HAREL, D., PNUELI, A., PRUZAN-SCHMIDT,J.,AND SHERMAN, R. 1987. On the formal semantics of Statecharts. In Proceedings of the 2nd Annual Symposium on Logic in Computer Science (LICS '87). IEEE Comp. Soc. Press, Ithaca, NY, pp. 56-64.]]Google Scholar
- HUIZING, C. 1991. Semantics of reactive systems: Comparison and full abstraction. Ph.D. dissertation. Eindhoven University of Technology, Eindhoven, The Netherlands.]]Google Scholar
- HUIZING, C., GERTH, R., AND DE ROEVER, W. 1988. Modeling Statecharts behavior in a fully abstract way. In Proceedings of the 13th Colloquium on Trees and Algebra in Programming (CAAP '88) (Nancy, France). M. Dauchet and M. Nivat, Eds. Lecture Notes in Computer Science, vol. 299. Springer-Verlag, New York, pp. 271-294.]] Google ScholarDigital Library
- LEVESON, N., HEIMDAHL, M., HILDRETH, H., AND REESE, J. 1994. Requirements specification for process-control systems. ACM Trans. Softw. Eng. 20, 9 (Sept.), 684-707.]] Google ScholarDigital Library
- LEVI, F. 1997. Verification of temporal and real-time properties of Statecharts. Ph.D. dissertation. Univ. of Pisa-Genova-Udine, Italy.]]Google Scholar
- LUTTGEN,G.AND MENDLER, M. 2000. The intuitionism behind Statecharts steps. Tech. Rep. 2000- 28. NASA Contr. Rep. NASA/CR-2000-210302. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, VA, USA.]] Google ScholarDigital Library
- LUTTGEN,G.,VON DER BEECK, M., AND CLEAVELAND, R. 1999. Statecharts via process algebra. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR '99) (Eind-hoven, The Netherlands). J. Baeten and S. Mauw, Eds. Lecture Notes in Computer Science, vol. 1664. Springer-Verlag, New York, pp. 399-414.]] Google ScholarDigital Library
- LUTTGEN,G.,VON DER BEECK, M., AND CLEAVELAND, R. 2000. Acompositional approach to Statecharts semantics. In Proceedings of the 8th International Symposium on the Foundations of Software Engineering (FSE 2000). ACM Press, San Diego, Calif.]] Google ScholarDigital Library
- MAGGIOLO-SCHETTINI, A., PERON, A., AND TINI, S. 1996. Equivalences of Statecharts. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR '96) (Pisa, Italy). U. Montanari and V. Sassone, Eds. Lecture Notes in Computer Science, vol. 1119. Springer-Verlag, New York, pp. 687-702.]] Google ScholarDigital Library
- MARANINCHI, F. 1992. Operational and compositional semantics of synchronous automaton compositions. In Proceedings of the 3rd International Conference on Concurrency Theory (CONCUR '92) (Stony Brook, New York). R. Cleaveland, Ed. Lecture Notes in Computer Science, vol. 630. Springer-Verlag, New York, pp. 550-564.]] Google ScholarDigital Library
- PNUELI,A.AND SHALEV, M. 1991. What is in a step: On the semantics of Statecharts. In Proceedings of the 1st International Conference on Theoretical Aspects of Computer Software (TACS '91) (Sendai, Japan). T. Ito and A. Meyer, Eds. Lecture Notes in Computer Science, vol. 526. Springer- Verlag, New York, pp. 244-264.]] Google ScholarDigital Library
- SIMONS, A. 2000. On the compositional properties of UML Statechart diagrams. In Proceedings of the 3rd Conference on Rigorous Object-Oriented Methods, A. Clark, A. Evans, and K. Lano, Eds. Electric Workshops in Computing British Computer Society, York, U.K., 4.1-4.19.]]Google ScholarCross Ref
- USELTON,A.AND SMOLKA, S. 1994. A compositional semantics for Statecharts using labeled transition systems. In Proceedings of the 5th International Conference on Concurrency Theory (CONCUR '94) (Uppsala, Sweden). B. Jonsson and J. Parrow, Eds. Lecture Notes in Computer Science, vol. 836. Springer-Verlag, New York, pp. 2-17.]] Google ScholarDigital Library
- VAN DALEN, D. 1986. Intuitionistic logic. In Handbook of Philosophical Logic. Vol. III. Reidel, Dordrecht, The Netherlands, Chapt. 4, 225-339.]]Google Scholar
- VON DER BEECK, M. 1994. A comparison of Statecharts variants. In Proceedings of the 3rd International School and Symposium on Formal Techniques in Real-time and Fault-tolerant Systems (FTRTFT '94)(L~eck, Germany). H. Langmaack, W. de Roever, and J. Vytopil, Eds. Lecture Notes in Computer Science, vol. 863. Springer-Verlag, New York, pp. 128-148.]] Google ScholarDigital Library
- VON DER BEECK, M. 2000. A concise compositional Statecharts semantics definition. In Proceedings of the International Conference on Formal Desciption Techniques and Protocol Specification, Testing and Verification (FORTE XIII/PSTV XX 2000) (Pisa, Italy) T. Bolognesi and D. Latella, Eds. Kluwer Academic Publishers.]] Google ScholarDigital Library
Index Terms
- The intuitionism behind Statecharts steps
Recommendations
Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics
Prawitz proposed certain notions of proof-theoretic validity and conjectured that intuitionistic logic is complete for them [11, 12]. Considering propositional logic, we present a general framework of five abstract conditions which any proof-theoretic ...
A compositional approach to statecharts semantics
Statecharts is a visual language for specifying reactive system behavior. The formalism extends traditional finite-state machines with notions of hierarchy and concurrency, and it is used in many popular software design notations. A large part of the ...
Comments