Skip to main content
SpringerLink
Log in

Modifying LOTOS Specifications by Means of Automatable Formula-Based Integrations

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

The use of good (formal) specifications of software components produces a good characterization of their functionalities. This fact eases the modifiability of a module specification due to a change of requirements or to the need of an enhancement of its functionalities after the delivery to the users, and then, in general, eases also the reusability of a module. Moreover, if existing modules have a specification not based on a natural language but on the well-given syntax of a specification language, it is possible to process the needed modifications in an automatic way. This work presents a method to derive the modifications of the specification of an existing module (given by means of the LOTOS language) from a characterization of the environment, in which the new module has to be used, given by means of temporal logic formulae. The method consists of tableau-based rules that build the due modifications, and always produces a fitting solution for formulae that can be satisfied and belong to a given class.

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. Barbuti, R., De Francesco, N., Santone, A. and Vaglini, G.: Selective mu-calculus: New modal operators for proving properties on reduced transition systems, in Proceedings of FORTE X/PSTV XVII’ 97, Chapman & Hall, 1997, pp. 519-534.

  2. Barbuti, R., De Francesco, N., Santone, A. and Vaglini, G.: Selective mu-calculus and formula-based abstractions of transition systems, J. Comput. System Sci. 59(3) (1999), 537-556.

    Article  Google Scholar 

  3. Biggerstaff, T. J. (ed.): Software Reusability, Vol. 1: Concepts and Models, ACM Press, New York, 1989.

    Google Scholar 

  4. Bolognesi, T. and Brinksma, E.: Introduction to ISO specification language LOTOS, Comp. Networks and ISDN Systems 14 (1987), 25-59.

    Article  Google Scholar 

  5. Emerson, E. A. and Clarke, E. M.: Using branching time temporal logic to synthesize synchronization skeletons, Sci. Computer Programming 2(3) (1982), 241-266.

    Article  Google Scholar 

  6. Jeng, J. J. and Cheng, B. H. C.: Specification matching for software reuse: A foundation, in Proceedings of the ACM SIGSOFT Symposium on Software Reusability (SSR’95), 1995, pp. 97-105.

  7. Kozen, D.: Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983), 333-354.

    Article  Google Scholar 

  8. Krueger, C. W.: Software reuse, ACM Comput. Survey 24(2) (1992), 131-183.

    Article  Google Scholar 

  9. Larrabeiti, D., Quemada, J., Pavon, S. and Fernandez, A.: A practical approach to testing finite state systems, in Proceedings of COST-247 2nd International Workshop on Applied Formal Methods in System Design, 1997.

  10. Larsen, K. G. and Xinxin, L.: Compositionality through an operational semantics of contexts, in Proceedings of ICALP’90, Lecture Notes in Comput. Sci. 443, 1990, pp. 526-539.

  11. Larsen, K. G. and Xinxin, L.: Equation solving using modal transition systems, in Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1990, pp. 108-117.

  12. Maler, O., Pnueli, A. and Sifakis, J.: On the synthesis of discrete controllers for timed systems, in Proceedings of 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS’95), Lecture Notes in Comput. Sci. 900, Springer, 1995, pp. 229-242.

  13. Manna, Z. and Wolper, P.: Synthesis of communicating processes from temporal logic specifications, ACM Trans. on Programming Languages and Systems 6(1) (1984), 68-93.

    Article  Google Scholar 

  14. Milner, R.: Communication and Concurrency, Prentice-Hall, 1989.

  15. Parrow, J.: Submodule construction as equation solving in CCS, Theoret. Comput. Sci. 68(2) (1989), 175-202.

    Article  Google Scholar 

  16. Petrenko, A. and Yevtushenko, N.: Solving asynchronous equations, in Proceedings of FORTE/PSTV’98, 1998, pp. 231-247.

  17. Pnueli, A. and Rosner, R.: On the synthesis of a reactive module, in Proceedings of ACM Symp. POPL’89 24(2), 1989, pp. 179-190.

    Google Scholar 

  18. Qin, H. and Lewis, P.: Factorization of finite state machines under strong and observational equivalences, Formal Aspects of Computing 3 (1991), 284-307.

    Google Scholar 

  19. Quemada, J., Pavon, S. and Fernandez, A.: Transforming LOTOS specifications with LOLA - the parameterized expansion, in Proceedings of FORTE’ 88, 1988, pp. 45-54.

  20. Ramadge, P. J. and Wonham, W. M.: Supervisory control of a class of discrete event processes, SIAM J. Control Optim. 25 (1987), 206-230.

    Google Scholar 

  21. Santone, A. and Vaglini, G.: Reusing software components by means of automatable formula-based integrations, Technical Report PI-DII/7/2000, July 2000.

  22. Stirling, C.: An introduction to modal and temporal logics for CCS, in Concurrency: Theory, Language, and Architecture, Lecture Notes in Comput. Sci. 391, Springer, 1989.

Download references

Author information

Authors and Affiliations

  1. RCOST – Research Centre on Software Technology, University of Sannio, Benevento, Italy

    Antonella Santone

  2. Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Italy

    Gigliola Vaglini

Authors
  1. Antonella Santone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gigliola Vaglini
    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

Santone, A., Vaglini, G. Modifying LOTOS Specifications by Means of Automatable Formula-Based Integrations. Journal of Automated Reasoning 30, 33–58 (2003). https://doi.org/10.1023/A:1022561505762

Download citation

  • Issue Date:

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

Search

Navigation