• DocumentCode
    3321275
  • Title

    Feature interaction as a satisfiability problem

  • Author

    Areces, Carlos ; Bouma, Wiet ; De Rijke, Maarten

  • Author_Institution
    Amsterdam Univ., Netherlands
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    339
  • Lastpage
    346
  • Abstract
    We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the specification of additional features (call waiting, call forwarding, etc.). Furthermore, by using standard reasoning tasks from description logics, the properties of features can be formally proved and interactions detected. An EXPTIME upper bound for the complexity of detecting feature interaction as a satisfiability problem is provided by exploiting well-known results for expressive description languages
  • Keywords
    computability; formal specification; telecommunication computing; telephony; EXPTIME upper bound; additional features; basic telephone system; call forwarding; call waiting; description logic; expressive description languages; feature interaction; formal definition; satisfiability problem; specification; standard reasoning tasks; telephone features; Engineering management; Logic; Read only memory; Software development management; Software engineering; Software systems; TV; Telephony; Upper bound; Video on demand;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1999. Proceedings. 7th International Symposium on
  • Conference_Location
    College Park, MD
  • Print_ISBN
    0-7695-0381-0
  • Type

    conf

  • DOI
    10.1109/MASCOT.1999.805072
  • Filename
    805072