Clock constraints in UML/MARTE CCSL
2008
Abstract
The UML Prole for Modeling and Analysis of Real-Time and Embedded (RTE) systems has recently been adopted by the OMG. Its Time Model extends the informal and simplistic Simple Time package proposed by UML2 and oers a broad range of capabilities required to model RTE systems including both discrete/dense and chronometric/logical time. MARTE OMG specication introduces a Time Structure inspired from Time models of the concurrency theory and proposes a new clock constraint specication language (CCSL) to specify, within the context of UML, usual logical and chronometric time constraints. This paper presents, for the rst time, the formal semantics of some representative CCSL clock constraints concerning logical discrete-time. Considering the Time Structure as a concurrent system, we propose a dynamic interpretation to build acceptable solutions that fully respect the constraints. An unusual example about processing Easter days illustrates the use of CCSL and the construction of solutions.
References (39)
- Object Management Group: Unied Modeling Language, Superstructure (November 2007) Version 2.1.2 formal/2007-11-02.
- Object Management Group: UML Prole for MARTE, beta 1. (August 2007) OMG document number: ptc/07-08-04.
- Lee, E.A., Sangiovanni-Vincentelli, A.L.: A framework for comparing models of com- putation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17(12) (December 1998) 12171229
- Benveniste, Caspi, Edwards, Hallbwachs, Guernic, L., de Simone: The synchronous languages twelve years later. Proceedings of the IEEE 91(1) (2003)
- André, C., Mallet, F., de Simone, R.: Modeling time(s). In Engels, G., Opdyke, B., Schmidt, D.C., Weil, F., eds.: MoDELS. Volume 4735 of Lecture Notes in Computer Science., Springer (2007) 559573
- Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7) (1978) 558565
- Cohen, A., Duranton, M., Eisenbeis, C., Pagetti, C., Plateau, F., Pouzet, M.: N- synchronous Kahn networks. In: POPL 2006 Proceedings. (January 2006)
- Li, X., Meng, C., Yu, P., Zhao, J., Zheng, G.: Timing analysis of UML activity diagrams. In Gogolla, M., Kobryn, C., eds.: UML. Volume 2185 of Lecture Notes in Computer Science., Springer (2001) 6275
- Damm, W., Josko, B., Pnueli, A., Votintseva, A.: A discrete-time UML semantics for concurrency and communication in safety-critical applications. Sci. Comput. Program. 55(1-3) (2005) 81115
- Störrle, H.: Semantics and verication of data ow in UML 2.0 activities. Electr. Notes Theor. Comput. Sci. 127(4) (2005) 3552
- Petri, C.: Concurrency theory. In Brauer, W., Reisig, W., Rozenberg, G., eds.: Petri Nets: Central Models and their properties. Volume 254 of Lecture Notes in Computer Science. Springer-Verlag (1987) 424
- Reisig, W.: Petri nets: an introduction. Monograph on Theoretical Computer Science. Springer-Verlag, Berlin (1985)
- RR n°6540
- Merlin, P.: Study of the Recoverability of Computer Systems. PhD, University of California, Irvine (1974)
- Benveniste, A., Guernic, P.L., Jacquemot, C.: Synchronous programming with events and relations: the signal language and its semantics. Sci. Comput. Program. 16(2) (1991) 103149
- Berthomieu, B., Vernadat, F.: Time petri nets analysis with TINA. In: QEST, IEEE Computer Society (2006) 123124
- 2.1 Clock . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 2.2 Time structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 3 Example: Easter date
- 3.1 Specication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 3.2 Modeling in terms of logical clocks . . . . . . . . . . . . . . . . . . . . . . . .
- 4 Expression of clock constraints
- 4.1 Coincidence-based clock constraint . . . . . . . . . . . . . . . . . . . . . . . .
- 4.1.1 Sub-Clocking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 4.1.2 Derived coincidence-based clock constraints . . . . . . . . . . . . . . .
- 4.2 Precedence-based clock constraint . . . . . . . . . . . . . . . . . . . . . . . . .
- 4.2.1 Precedence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 4.2.2 Derived precedence-based clock constraints . . . . . . . . . . . . . . .
- 4.3 Mixed constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 4.3.1 Sampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- 5 Time Structure as concurrent system 10 5.1 Clock Dependency Graph (CDG) . . . . . . . . . . . . . . . . . . . . . . . . . 10
- 2 Behavior of a Time Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 5.2.1 Dynamic Constraint Graph . . . . . . . . . . . . . . . . . . . . . . . . 11
- 3 Construction of the DCG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
- 4 Determination of a Step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 5.4.1 Enabled clocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
- 5.4.2 Fireable clocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
- 4.3 Step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
- 5.4.4 Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 INRIA Unité de recherche INRIA Sophia Antipolis 2004, des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche Futurs : Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex (France)
- Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France)
- Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Éditeur INRIA -Domaine de Voluceau -Rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN 0249-6399