Skip to main content
SpringerLink
Log in

Formal Methods of Analysis of System Properties

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A review of using formal methods of specification and verification of software and hardware systems is given and an approach and formal methods are proposed that make it possible to solve the so-called feature interaction problem arising in telecommunication systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. S. Budkowski and P. Dembinski, “An introduction to ESTELLE: A specification language for distributed systems,” Computer Networks and ISDN Systems, 14, 3-23 (1987).

    Google Scholar 

  2. T. Bolongesi and E. Brinksma, “Introduction to ISO specification language LOTOS,” Computer Networks and ISDN Systems, 14, 25-59 (1987).

    Google Scholar 

  3. R. Saracco and A. J. Tilanus, “CCITT SDL: Overview of the language and its applications,” Computer Networks and ISDN Systems, 14, 65-74 (1987).

    Google Scholar 

  4. C. A. R. Hoare, Communicating Sequential Processes, Prentice Hall, New York (1985).

    Google Scholar 

  5. A. Milner, “A calculus for communication systems,” LNCS, 92, 5-32 (1992).

    Google Scholar 

  6. D. Harel, “Statecharts: A visual formalism for complex systems,” in: Science of Computer Programming 8, Techn. Rep. CS84-05, Weizmann Inst. of Sci., Rechovot, Israel (1984), pp. 231-274.

    Google Scholar 

  7. A. Pnuelli, “A temporal semantics of concurrent programs,” TCS, No. 13, 45-60 (1981).

  8. N. Lynch and M. Tuttle, “Hierarchical correctness proofs for distributed algorithms,” Techn. Rep., MIT Lab. for Comp. Sci., Cambridge, MA (1987).

    Google Scholar 

  9. M. Y. Vardi and P. Wolper, “An automata-theoretic approach to automatic program verification,” in: Proc. 1st Ann. IEEE Symp. on Logic in Comp. Sci., Cambridge, England (1986), pp.322-331.

    Google Scholar 

  10. R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. on Computers C-35 8-32 (1986).

    Google Scholar 

  11. K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem, Kluwer Academic, Amsterdam (1993).

    Google Scholar 

  12. R. Gerth, D. Peled, M. Y. Vardi, et al., “Simple on-the-fly automatic verification of linear temporal logic,” in: Proc. IFIP/WG6.1 Symp. on Protoc. Specif., Testing and Verification (Warsaw, Poland, June 1995), Chapman&Hall, London (1995), pp. 121-132.

    Google Scholar 

  13. S. Rajan, N. Shankar, and M. Srivas, “An integration of model-checking with automated proof checking,” Computer-Aided Verification '95; LNCS, 939, 84-97, Springer-Verlag, Berlin-Heidelberg (1995).

    Google Scholar 

  14. V. N. Red'ko and N. S. Nikitchenko, “Composition aspects of programmology. I,” Kibernetika, No. 5, 49-56 (1987).

  15. N. D. Griffeth and Y. J. Lin, “Extending telecommunications systems: The feature interaction problem,” IEEE Computer, 26, 14-18 (1993).

    Google Scholar 

  16. M. Faci and L. Longrippo, “Specifying features and analyzing their interactions in a LOTOS environment,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1994), pp. 136-151.

    Google Scholar 

  17. B. Stepien and L. Longrippo, “Feature interaction detection using backward reasoning with LOTOS,” in: Protocol Specification, Testing, and Verification XIV, Chapman&Hall, London (1995), pp. 71-86.

    Google Scholar 

  18. J. Blom, B. Johnson, and L. Kempe, “Using temporal logic for modular specification of telephone services,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1994), pp. 197-216.

    Google Scholar 

  19. J. Blom, B. Johnson, and L. Kempe, “Automatic detection of feature interactions in temporal logic,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1995), pp. 1-19.

    Google Scholar 

  20. Y. Kakuda, A. Inoue, H. Asada, et al., “A dynamic resolution method for feature interactions and its evaluation,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1995), pp. 97-114.

    Google Scholar 

  21. B. Chribi and L. Longrippo, “Model checking for LOTOS,” Techn. Rep. TR-92-19, Dep. of Comp. Sci., Univ. of Ottawa (1992).

  22. J. Brederke and R. Gotzhein, “Specification and resolution of feature interactions with ESTELLE,” in: Proc. Formal Description Techniques, North Holland, Amsterdam (1994), pp. 366-368.

    Google Scholar 

  23. M. Faci and L. Longrippo, “An algebraic approach to the detection of feature interactions,” Techn. Rep. TR-94-19, Dep. of Computer Sci., Univ. of Ottawa (1994).

  24. B. Stepien and L. Longrippo, “Representing and verifying intentions in telephony features using abstract data types,” in: Feature Interactions in Telecommunication Systems III, IOS Press, Amsterdam (1995), pp. 141-155.

    Google Scholar 

  25. K. E. Cheng, “Towards a formal model for incremental service specification and interaction management support,” in: Feature Interactions in Telecommunication Systems III, IOS Press, Amsterdam (1994), pp. 152-166.

    Google Scholar 

  26. P. Combes and S. Pickin, “Formalization of a user view of networks and services for feature interaction detection,” in: Feature Interactions in Telecommunication Systems III, IOS Press, Amsterdam (1994), pp. 121-135.

    Google Scholar 

  27. T. Y. Cheung and Y. Lu, “Detection and resolving of interactions between telephone features terminating call screening and call forwarding by colored Petri nets,” in: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, IEEE Comp. Soc. (1995), pp. 2245-2250.

  28. M. Nakamura, Y. Kakuda, and T. Kikuno, “Analyzing non-determinism in telecommunication services using a P-invariant of a Petri-net model,” in: Proc. IEEE INFOCON'97, IEEE Comp. Soc. (1997), pp. 49-65.

  29. M. Nakamura, Y. Kakuda, and T. Kikuno, “A Petri-net-based detection method for nondeterministic feature interactions and its experimental evaluation,” in: Feature Interactions in Telecommunication Networks IV, IOS Press, Amsterdam (1997), pp. 138-152.

    Google Scholar 

  30. W. M. Mak and T. Y. Cheung, “A framework and a review on formal methods for managing feature interactions in telecommunication systems,” Techn. Rep. TR-97-03, Dep. of Comp. Sci., City Univ. of Hong Kong. (1997).

  31. A. Gammelgaard and J. K. Kristensen, “Interaction detection: A logical approach,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1994), pp. 178-196.

    Google Scholar 

  32. F. J. Lin and Y. J. Lin, “A building block approach to detecting and resolving feature interactions,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1994), pp. 86-119.

    Google Scholar 

  33. Y. Kawarasaki and T. Ochta, “A new proposal for feature interaction detection and elimination,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1995), pp. 127-139.

    Google Scholar 

  34. K. H. Braithwaite and J. M. Atlee, “Towards automated detection of feature interactions,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1994), pp. 36-59.

    Google Scholar 

  35. A. Khoumski, “Detection and resolution of interactions between services of telephone networks,” in: Feature Interactions in Telecommunication Systems, IOS Press, Amsterdam (1997), pp. 78-92.

    Google Scholar 

  36. T. Y. Cheung and Y. Lu, “Five classes of invariant-preserving transformations on colored Petri nets,” Application and Theory of Petri Nets; LNCS, 1630, 78-92, Springer-Verlag, Berlin-Heidelberg (1999).

    Google Scholar 

  37. H. Velthuijsen, “Issues of nonmonotonicity in feature interaction detection,” in: Feature Interactions in Telecommunication Systems III, IOS Press, Amsterdam (1995), pp. 1-19.

    Google Scholar 

  38. T. Murata,“Petri Nets: Properties, analysis, and applications,” in: Proc. IEEE, 77, No. 4, 541-580 (1989).

  39. S. L. Kryvyi,“Methods of Solution and Criteria of Consistency of Systems of Linear Diophantine Equations over the Set of Natural Numbers,”

Download references

Author information

Authors and Affiliations

  1. National Academy of Sciences of Ukraine, Cybernetics Institute, Kiev, Ukraine

    S. L. Kryvyi & L. Ye. Matveyeva

Authors
  1. S. L. Kryvyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Ye. Matveyeva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kryvyi, S.L., Matveyeva, L.Y. Formal Methods of Analysis of System Properties. Cybernetics and Systems Analysis 39, 174–191 (2003). https://doi.org/10.1023/A:1024783021463

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024783021463

Search

Navigation