Abstract
Scenario-based modeling in live sequence charts (LSC) involves specifying multi-modal inter-object scenarios, in which events can be mandatory (hot) or possible (cold). In translating LSCs into automata over infinite words, an intermediate step constructs a kind of transition system that we call a modal state structure (MSS). Here we present MSSs as abstract forms of modal scenarios (with both mandatory, possible and forbidden behavior), which may encode more general patterns than those inherent in LSC, such as loops, alternatives and breaks. MSSs are essentially automata, in which the notion of temperature is adopted from LSCs, replacing traditional acceptance conditions.
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
Bontemps, Y.: Relating Inter-Agent and Intra-Agent Specifications (The Case of Live Sequence Charts). Ph.D. thesis, Facultés Universitaires Notre-Dame de la Paix, Institut d’Informatique (University of Namur, Computer Science Dept) (April 2005)
Bontemps, Y., Heymans, P., Schobbens, P.Y.: From live sequence charts to state machines and back: A guided tour. IEEE Trans. Software Eng. 31(12), 999–1014 (2005)
Brill, M., Damm, W., Klose, J., Westphal, B., Wittke, H.: Live Sequence Charts. In: Ehrig, H., Damm, W., Desel, J., Große-Rhode, M., Reif, W., Schnieder, E., Westkämper, E. (eds.) INT 2004. LNCS, vol. 3147, pp. 374–399. Springer, Heidelberg (2004)
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Internat. Congress on Logic Methodology and Philosophy of Science 1960, pp. 1–12. Stanford Univ. Press, Stanford (1962)
Damm, W., Harel, D.: LSCs: Breathing Life into Message Sequence Charts. J. on Formal Methods in System Design 19(1), 45–80 (2001); preliminary version in Ciancarini, P., Fantechi, A., Gorrieri, R. (eds.): Proc. 3rd IFIP Int. Conf. on Formal Methods for Open Object-Based Distributed Systems (FMOODS 1999), pp. 293–312. Kluwer Academic Publishers (1999)
D’Ippolito, N., Fischbein, D., Chechik, M., Uchitel, S.: MTSA: The Modal Transition System Analyser. In: Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE 2008), pp. 475–476. IEEE Computer Society, Washington, DC (2008)
Drusinsky, D., Harel, D.: On the power of bounded concurrency I: finite automata. J. ACM 41(3), 517–539 (1994)
Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-Based Model Checking Using Modal Transition Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 426–440. Springer, Heidelberg (2001)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
Harel, D.: Statecharts: A visual formalism for complex systems. Sci. Comput. Program. 8(3), 231–274 (1987)
Harel, D., Gery, E.: Executable object modeling with statecharts. IEEE Computer 30(7), 31–42 (1997)
Harel, D., Kantor, A.: Multi-modal scenarios revisited: A net-based representation. Theoretical Computer Science 429, 118–127 (2012)
Harel, D., Maoz, S.: Assert and Negate Revisited: Modal Semantics for UML Sequence Diagrams. Software and Systems Modeling (SoSyM) 7(2), 237–252 (2008). Preliminary version appeared in Proc. 5th Int. Workshop on Scenarios and State-Machines (SCESM 2006) at the 28th Int. Conf. on Soft. Eng (ICSE 2006), May 13-19, pp. 237–252. ACM Press
Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer (2003)
ITU: International Telecommunication Union Recommendation Z.120: Message Sequence Charts. Tech. rep. (1996)
Klose, J., Klose, H.: An Automata Based Interpretation of Live Sequence Charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 512–527. Springer, Heidelberg (2001)
Kugler, H., Harel, D., Pnueli, A., Lu, Y., Bontemps, Y.: Temporal Logic for Scenario-Based Specifications. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 445–460. Springer, Heidelberg (2005)
Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Logic 2(3), 408–429 (2001)
Larsen, K.G., Thomsen, B.: A modal process logic. In: Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS 1988), pp. 203–210. IEEE Computer Society Press (1988)
Miyano, S., Hayashi, T.: Alternating finite automata on ω-words. Theor. Comput. Sci. 32(3), 321–330 (1984)
Mukund, M.: Finite-state automata on infinite inputs. In: The 6th National Seminar on Theoretical Computer Science, Banasthali, Rajasthan, India (August 1996)
Peterson, J.L.: Petri nets. ACM Comput. Surv. 9(3), 223–252 (1977)
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1989), pp. 179–190. ACM, New York (1989)
Reisig, W.: Petri nets: an introduction. Springer, New York (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Harel, D., Kantor, A. (2014). Modal Scenarios as Automata. In: Dershowitz, N., Nissan, E. (eds) Language, Culture, Computation. Computing - Theory and Technology. Lecture Notes in Computer Science, vol 8001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45321-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-45321-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45320-5
Online ISBN: 978-3-642-45321-2
eBook Packages: Computer ScienceComputer Science (R0)