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.
Chapter PDF
Similar content being viewed by others
References
Brandin, B.A., Wonham, W.M.: Supervisory Control of Timed Discrete Event Systems. IEEE Transactions on Automatic Control 39(2), 329–342 (1994)
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)
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)
Drissi, J., Bochmann, G.V.: Submodule Construction for Systems of I/O Automata. Tech. Rep. no. 1133, DIRO, University of Montreal (1999)
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)
Kelekar, S.G., Hart, G.W.: Synthesis of Protocols and Protocol Converters Using the Submodule Construction Approach. In: PSTV 1993, pp. 307–322 (1993)
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)
Larsen, K., Xinxin, L.: Equation solving using modal transition systems. In: LICS 1990 (1990)
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)
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)
Petrenko, A., Yevtushenko, N.: Solving Asynchronous Equations. In: FORTE 1998, pp. 231–247 (1998)
Parrow, J.: Submodule Construction as Equation Solving in CCS. Theoretical Computer Science 68 (1989)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Daou, B., Bochmann, G.v. (2006). Generalizing the Submodule Construction Techniques for Extended State Machine Models. In: Najm, E., Pradat-Peyre, JF., Donzeau-Gouge, V.V. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2006. FORTE 2006. Lecture Notes in Computer Science, vol 4229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11888116_15
Download citation
DOI: https://doi.org/10.1007/11888116_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46219-4
Online ISBN: 978-3-540-46220-0
eBook Packages: Computer ScienceComputer Science (R0)