Abstract.
In this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation \(A \Diamond X \cong C\). We present algorithms for deriving the largest progressive solution to the equation that combined with A does not block any possible action in C and we introduce a new simulation relation between automata in order to characterize all progressive solutions.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Barrett, G., Lafortune, S.: Bisimulation: The Supervisory Control Problem, and Strong Model Matching for Finite State Machines. Discrete Event Dynamic Systems: Theory and Application 8(4), 377–429 (1998)
Bochmann G.v., Merlin, P.: On the Construction of Communication Protocols. In: ICCC, pp. 371–378 (1980); reprinted in: Sunshine, C. (ed.): Communication Protocol Modeling. Artech House Publ. (1981)
Drissi, J., Bochmann, G.v.: Submodule Construction for Systems of I/O Automata, ftp://beethoven.site.uottawa.ca/Publications/Dris99b.pdf
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Kelekar, S.G.H.: Synthesis of Protocols and Protocol Converters Using the Submodule Construction Approach. In: Danthine, A., et al. (eds.) Proc. PSTV, XIII (1994)
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)
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)
Parrow, J.: Submodule Construction as Equation Solving in CCS. Theoretical Computer Science 68 (1989)
Petrenko, A., Yevtushenko, N.: Solving Asynchronous Equations. In: Proc. of IFIP FORTE/PSTV 1998 Conf., Chapman-Hall, Boca Raton (1998)
Petrenko, A., Yevtushenko, N., Bochmann, G.v., Dssouli, R.: Testing in Context: Framework and Test Derivation. Computer Communications Journal, Special issue on Protocol engineering 19, 1236–1249 (1996)
Qin, H., Lewis, P.: Factorisation of Finite State machines Under Strong and Observational Equivalences. Journal of Formal Aspects of Computing 3, 284–307 (1991)
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)
Wonham, W.M., Ramadge, P.J.: On the Supremal Controllable Sublanguage of a Given Language. SIAM J. Control. Optim. 25(3), 637–659 (1987)
Yevtushenko, N., Villa, T., Brayton, R.K., Petrenko, A., Sangiovanni-Vincentelli, A.: Solving a Parallel Language Equation. In: Proc. of the ICCAD 2001, USA (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Buffalov, S., El-Fakih, K., Yevtushenko, N., Bochmann, G.v. (2003). Progressive Solutions to a Parallel Automata Equation. In: König, H., Heiner, M., Wolisz, A. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2003. FORTE 2003. Lecture Notes in Computer Science, vol 2767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39979-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39979-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20175-5
Online ISBN: 978-3-540-39979-7
eBook Packages: Springer Book Archive