Products of finite state machines with full coverage

  • David M. Cohen
  • Michael L. Fredman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 700)


Given a collection of finite state machines, {M i }, with the same input alphabet, let M be the product machine, MM j . In general, not every state in M is reachable. A natural question is whether there are any inherent limits to the number of reachable states in a system that is the product of many small finite state machines. This note constructs a family of product machines M where the number of states is doubly exponential in the number of states in any individual machine M i and every product state is reachable.

Products of finite state machines such as discussed in this note occur when analyzing large collections of independently designed telecommunications services. These examples raise the possibility that product finite state machines modeling systems of independently designed services may have different characteristics from finite state machines modeling communications protocols. Consequently, analyzing collections of telecommunications services may require new heuristic methods.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. E. Bryant, Ordered Binary Decision Diagrams, ACM Computing Surveys, 24 (1992), 293–318.Google Scholar
  2. 2.
    E.J. Cameron,N. Griffeth, Y-J Lin, M. E. Nilson, W. Schnure, H. Velthuijsen, Towards a Feature Interaction Benchmark, to appear in IEEE Communications Magazine.Google Scholar
  3. 3.
    D. M. Cohen, Some Experiments Analyzing Flat Configurations of Finite State Machines, non-proprietary Bellcore Technical Memo, April 30 1992, TM-ARH-021362.Google Scholar
  4. 4.
    F. Dworak, T. Bowen, C. W. Chow, G. E. Herman, N. Griffeth, and Y-J Lin, Feature Interaction Problem in Telecommunication, Proceedings of the Seventh Int'l Conference on Software Engineering for Telecommunications Switching Systems, Bournemouth, UK, July 1989, pp 59–62.Google Scholar
  5. 5.
    D. Gorenstein, Finite Simple Groups: An Introduction to their Classification, Plenum Press, 1982.Google Scholar
  6. 6.
    G. J. Holzmann, Design and Validation of Computer Protocols, Prentice-Hall, 1991.Google Scholar
  7. 7.
    B. Huppert, Zweifach transitive auflosbare Permutationsgruppen, Mathematische Zeitschrift, 68 (1957), 126–150.Google Scholar
  8. 8.
    D. S. Passman, Permutation Groups, Benjamin, 1969.Google Scholar
  9. 9.
    W. R. Scott, Group Theory, Prentice-Hall, 1964.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • David M. Cohen
    • 1
  • Michael L. Fredman
    • 2
  1. 1.BellcoreUSA
  2. 2.Rutgers and UCSDTurkey

Personalised recommendations