Abstract
Modal transition systems (MTSs) and their variants such as Disjunctive MTSs (DMTSs) have been extensively studied as a formalism for partial behaviour model specification. Their semantics is in terms of implementations, which are fully specified behaviour models in the form of Labelled Transition Systems. A natural operation for these models is that of merge, which should yield a partial model which characterizes all common implementations. Merging has been studied for models with the same vocabularies; however, to enable composition of specifications from different viewpoints, merging of models with different vocabularies must be supported as well. In this paper, we first prove that DMTSs are not closed under merge for models with different vocabularies. We then define an extension to DMTS called rDMTS, for which we describe a first exact algorithm for merging partial models, provided they satisfy an easily checkable compatibility condition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beneš, N., Černá, I., Křetínský, J.: Modal Transition Systems: Composition and LTL Model Checking. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 228–242. Springer, Heidelberg (2011)
Chechik, M., Brunet, G., Fischbein, D., Uchitel, S.: Partial behavioural models for requirements and early design. In: Proc. of MMOSS 2006 (2006)
Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, The Netherlands (July 1996)
D’Ippolito, N., Fischbein, D., Chechik, M., Uchitel, S.: MTSA: The Modal Transition System Analyser. In: Proc. of ASE 2008, pp. 475–476 (2008)
Fischbein, D., Braberman, V.A., Uchitel, S.: A Sound Observational Semantics for Modal Transition Systems. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 215–230. Springer, Heidelberg (2009)
Fischbein, D., D’Ippolito, N., Brunet, G., Chechik, M., Uchitel, S.: Weak Alphabet Merging of Partial Behavior Models. ACM TOSEM 21(2), 9 (2012)
Fischbein, D., Uchitel, S.: On Correct and Complete Strong Merging of Partial Behaviour Models. In: Proc. of SIGSOFT FSE 2008, pp. 297–307 (2008)
Harel, D.: StateCharts: A Visual Formalism for Complex Systems. Sc. of Comp. Prog. 8, 231–274 (1987)
Hüttel, H., Larsen, K.G.: The Use of Static Constructs in A Modal Process Logic. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 163–180. Springer, Heidelberg (1989)
Keller, R.M.: Formal Verification of Parallel Programs. CACM 19(7) (1976)
Larsen, K.G., Thomsen, B.: A Modal Process Logic. In: Proc. of LICS (1988)
Larsen, K.G., Xinxin, L.: Equation Solving Using Modal Transition Systems. In: Proc. of LICS 1990, pp. 108–117 (1990)
Sibay, G., Uchitel, S., Braberman, V.A.: Existential Live Sequence Charts Revisited. In: Proc. of ICSE 2008, pp. 41–50 (2008)
Uchitel, S., Brunet, G., Chechik, M.: Synthesis of Partial Behavior Models from Properties and Scenarios. IEEE TSE 35(3), 384–406 (2009)
Uchitel, S., Chechik, M.: Merging Partial Behavioural Models. In: Proc. of SIGSOFT FSE 2004, pp. 43–52 (2004)
Zave, P., Jackson, M.: Conjunction as composition. ACM TOSEM 2, 379–411 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-David, S., Chechik, M., Uchitel, S. (2013). Merging Partial Behaviour Models with Different Vocabularies. In: D’Argenio, P.R., Melgratti, H. (eds) CONCUR 2013 – Concurrency Theory. CONCUR 2013. Lecture Notes in Computer Science, vol 8052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40184-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-40184-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40183-1
Online ISBN: 978-3-642-40184-8
eBook Packages: Computer ScienceComputer Science (R0)