Advertisement

Generalizing the Submodule Construction Techniques for Extended State Machine Models

  • Bassel Daou
  • Gregor v. Bochmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4229)

Abstract

In previous research we extended the submodule construction techniques to cover a more expressive and compact behavioral model that handles data through parameterized interactions, state variables, and simple transition guards. The model was based on extended Input/Output Automata, and the algorithm on the Chaos concept. In this paper we generalize these extensions and improve the submodule construction techniques and algorithms. The generalizations include regular transition guards including equality and inequality, negation, conjunction and disjunction of predicates. The algorithm is improved by utilizing the concept of generic transitions (non refined transitions) that are refined as needed instead of considering all possible refinements of the Chaos. The algorithm selects needed refinements through dataflow relations bridging which involves forward propagation of definitions and backward propagation of usages. The new approach provides a more intuitive explanation of the submodule construction algorithm, gives justification for the number of variables in the new module and results in a much smaller and compact solution.

References

  1. [BrWo94]
    Brandin, B.A., Wonham, W.M.: Supervisory Control of Timed Discrete Event Systems. IEEE Transactions on Automatic Control 39(2), 329–342 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [CDFM01]
    Carchiolo, V., De Francesco, N., Fantechi, A., Mangioni, G.: ESA: An approach to Systems Design by Equation Solving. In: FMICS 2001, Paris, France (July 2001)Google Scholar
  3. [DaBo05]
    Daou, B., von Bochmann, G.: Submodule Construction for Extended State Machine Models. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 396–410. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. [DrBo99]
    Drissi, J., Bochmann, G.V.: Submodule Construction for Systems of I/O Automata. Tech. Rep. no. 1133, DIRO, University of Montreal (1999)Google Scholar
  5. [JoLa91]
    Jonsson, B., Larsen, K.G.: On the complexity of equation solving in behavior expression algebra. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 381–396. Springer, Heidelberg (1991)Google Scholar
  6. [KeHa93]
    Kelekar, S.G., Hart, G.W.: Synthesis of Protocols and Protocol Converters Using the Submodule Construction Approach. In: PSTV 1993, pp. 307–322 (1993)Google Scholar
  7. [KNM97]
    Kumar, R., Nelvagal, S., Marcus, S.I.: A Discrete Event Systems Approach for Protocol Conversion. Discrete Event Dynamical Systems: Theory and Applications 7(3), 295–315 (1997)CrossRefzbMATHGoogle Scholar
  8. [LaXi90]
    Larsen, K., Xinxin, L.: Equation solving using modal transition systems. In: LICS 1990 (1990)Google Scholar
  9. [LeQi90]
    Lewis, P., Qin, H.: Factorization of finite state machines under observational equivalence. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, Springer, Heidelberg (1990)Google Scholar
  10. [MeBo83]
    Merlin, P., Bochmann, G.v.: On The Construction of Submodule Specifications and Communication Protocols. ACM Trans. On Programming Languages and Systems 5(1), 1–25 (1983)CrossRefzbMATHGoogle Scholar
  11. [PeYe98]
    Petrenko, A., Yevtushenko, N.: Solving Asynchronous Equations. In: FORTE 1998, pp. 231–247 (1998)Google Scholar
  12. [Parr89]
    Parrow, J.: Submodule Construction as Equation Solving in CCS. Theoretical Computer Science 68 (1989)Google Scholar
  13. [TBD97]
    Tao, Z., Bochmann, G.v., Dssouli, R.: A Formal Method For Synthesizing Optimized Protocol Converters And Its Application To Mobile Data Networks. Mobile Networks & Applications 2(3), 259–269 (1997)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Bassel Daou
    • 1
  • Gregor v. Bochmann
    • 1
  1. 1.School of Information Technology and Engineering (SITE)University of OttawaCanada

Personalised recommendations