Progressive Solutions to a Parallel Automata Equation

  • Sergey Buffalov
  • Khaled El-Fakih
  • Nina Yevtushenko
  • Gregor v. Bochmann
Conference paper

DOI: 10.1007/978-3-540-39979-7_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2767)
Cite this paper as:
Buffalov S., El-Fakih K., Yevtushenko N., Bochmann G.. (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

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.

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2003

Authors and Affiliations

  • Sergey Buffalov
    • 1
  • Khaled El-Fakih
    • 2
  • Nina Yevtushenko
    • 1
  • Gregor v. Bochmann
    • 3
  1. 1.Tomsk State UniversityRussia
  2. 2.Department of Computer ScienceAmerican University of SharjahUAE
  3. 3.School of Information Technology and EngineeringUniversity of OttawaCanada

Personalised recommendations