Submodule Construction for Extended State Machine Models

  • Bassel Daou
  • Gregor V. Bochmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3731)

Abstract

In this paper, we consider the problem of extending existing submodule construction techniques that have been developed for finite state models into more expressive and compact behavioral models that handle data through parameterized interactions, state variables and simple guards. We provide a behavioral model based on extended Input-Output Automata and describe an algorithm that provides the solution to the submodule construction problem in the context of this extended behavioral model. This algorithm is based on abstracting variable configurations using the concept of variable partitions, and splitting of states obtained from the finite state machine model in order to satisfy the constraints imposed by the values of exchanged interaction parameters.

Keywords

Variable Assignment Variable Partition Discrete Event System State Split Variable Configuration 
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.
Download to read the full conference paper text

References

  1. [BEYB03]
    Buffalov, S., El-Fakih, K., Yevtushenko, N., Bochmann, G.V.: Progressive Solutions to a Parallel Automata Equation. In: FORTE 2003, pp. 367–382 (2003)Google Scholar
  2. [Boch02]
    Bochmann, G.V.: Submodule Construction for Specifications with Input Assumptions and Output Guarantees. In: FORTE 2002, pp. 17–33 (2002)Google Scholar
  3. [BrWo94]
    Brandin, B.A., Wonham, W.M.: Supervisory Control of Timed Discrete Event Systems. IEEE Transactions on Automatic Control 39(2), 329–342 (1994)MathSciNetCrossRefMATHGoogle 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. [Hoar85]
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Inc., Englewood Cliffs (1985)MATHGoogle 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)CrossRefMATHGoogle Scholar
  8. [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
  9. [LyTu89]
    Lynch, N., Tuttle, M.: An introduction to input/output automata. CWI Quarterly 3(2), 219–246 (1989)MathSciNetMATHGoogle 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)CrossRefMATHGoogle Scholar
  11. [NeBr95]
    Negulescu, R., Brzozowski, J.A.: Relative liveness: from intuition to automated verification. In: ASYNC 1995, pp. 108–117 (1995)Google Scholar
  12. [Parr89]
    Parrow, J.: Submodule Construction as Equation Solving in CCS. Theoretical Computer Science 68 (1989)Google Scholar
  13. [PeYe98]
    Petrenko, A., Yevtushenko, N.: Solving Asynchronous Equations. In: Proc. of IFIP FORTE/PSTV 1998 Conf., Paris. Chapman-Hall, Boca Raton (1998)Google Scholar
  14. [QiLe91]
    Qin, H., Lewis, P.: Factorisation Of Finite State Machines Under Strong and Observational Equivalences. Journal of Formal Aspects of Computing 3, 284–307 (1991)CrossRefMATHGoogle Scholar
  15. [RBJ00]
    Rusu, V., du Bousquet, L., Jéron, T.: An Approach to Symbolic Test Generation. In: IFM 2000, pp. 338–357 (2000)Google Scholar
  16. [Shie89]
    Shields, M.W.: Implicit system specification and the interface equation. The Computer Journal 32(5), 399–412 (1989)MathSciNetCrossRefGoogle Scholar
  17. [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 2005

Authors and Affiliations

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

Personalised recommendations