Abstract
In this paper, we show how to implement the conformance relation on transition systems. The computability of this relation relies on the composition of two operators: the reduction relation whose computability has been proven in our previous work, and the merge function of acceptance graphs associated with transition systems under comparison. It is formally demonstrated, and illustrated through a case study whose analysis is performed by a Java prototype we have developed. This research work is developed in order to be applied in a larger context: our goal is to support modelers to develop UML state machines through an incremental modelling method which is able to guarantee that model upgrading does not introduce inconsistencies. Hence, these works lead to a semantics for the specialisation relation between UML State Machines.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
OMG: Unified Modeling Language Specification. Object Management Group (2007)
Boiten, E., Bujorianu, M.: Exploring UML refinement through unification. In: Jürjens, J., Rumpe, B., France, R., Fernandez, E. (eds.) Critical Systems Development with UML - Proceedings of the UML 2003 workshop. Number TUM-I0323, Technische Universität München, pp. 47–62 (September 2003)
Beeck, M.V.D.: Behaviour specifications: Equivalence and refinement notions. Techreport 24/00-I, Universität Münster (November 2000)
Luong, H.V., Lambolais, T., Courbis, A.L.: Implementation of extension and reduction relations for incremental development of behavioural models. Technical Report RR-006-2008, EMA, Laboratoire LGI2P, École des mines d’Alès (2008)
Lambolais, T., Gout, O.: Using conformance relations to help the development of state-machines. In: ISSRE 2004, International Symposium on Software Reliability Engineering (November 2004)
Gout, O.: Développement incrémental de spécifications orientées objets. PhD thesis, École de mines d’Alès (2006)
Milner, R.: Communicating and Mobile Systems: The π Calculus. Cambridge University Press, Cambridge (1999)
Brinksma, E., Scollo, G.: Formal Notions of Implementation and Conformance in LOTOS. Technical Report INF-86-13, Dept. of Informatics, Twente University of Technology (1986)
Hennessy, M.: Algebraic theory of processes. The Foundations Of Computing. MIT Press, Cambridge (1988) ISBN:0-262-08171-7
Leduc, G.: Conformance relation, associated equivalence, and minimum canonical tester in lotos. In: PSTV XI. North-Holland, Amsterdam (1991)
Tretmans, J.: Testing concurrent systems: A formal approach. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664. Springer, Heidelberg (1999)
Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 3 (1992)
ISO/IEC 9646-1: Information technology – Open Systems Interconnection – Conformance testing methodology and framework – Part 1: General concepts (1991)
Khendek, F., Bochmann, G.V.: Merging behavior specifications. Formal Methods in System Design 6, 259–293 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luong, HV., Lambolais, T., Courbis, AL. (2008). Implementation of the Conformance Relation for Incremental Development of Behavioural Models. In: Czarnecki, K., Ober, I., Bruel, JM., Uhl, A., Völter, M. (eds) Model Driven Engineering Languages and Systems. MODELS 2008. Lecture Notes in Computer Science, vol 5301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87875-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-87875-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87874-2
Online ISBN: 978-3-540-87875-9
eBook Packages: Computer ScienceComputer Science (R0)