skip to main content
article
Free Access

A graphical interval logic for specifying concurrent systems

Published:01 April 1994Publication History
Skip Abstract Section

Abstract

This article describes a graphical interval logic that is the foundation of a tool set supporting formal specification and verification of concurrent software systems. Experience has shown that most software engineers find standard temporal logics difficult to understand and use. The objective of this article is to enable software engineers to specify and reason about temporal properties of concurrent systems more easily by providing them with a logic that has an intuitive graphical representation and with tools that support its use. To illustrate the use of the graphical logic, the article provides some specifications for an elevator system and proves several properties of the specifications. The article also describes the tool set and the implementation.

References

  1. ~AABY, A. A., AND NARAYANA, K. T. 1988. Propositional temporal interval logic in PSPACE ~complete. In Proceedings of the 9th International Conference on Automated Deduction. Lecture ~Notes in Computer Science, vol. 193. Springer-Verlag, Berlin, 218-237. Google ScholarGoogle Scholar
  2. ~BARRINGER, H.~ KUIPER, R., AND PNUELI, A. 1984. Now you may compose temporal logic ~specifications. In Proceedings of the 16th ACM Symposium on Theory of Computing. ACM, ~New York. 51 63. Google ScholarGoogle Scholar
  3. ~DILLON, L. K., KUTTY, G., MELLIAR-SMITH, P. M., MOSER, L. E., AND RAMAKRISHNA, Y.S. 1994. ~Visual specifications for temporal reasoning. J. Vis Lang. Comput. 5, 1, 61-81.Google ScholarGoogle Scholar
  4. ~DILLON, L. K., KU'i~FY, G., MOSER, L. E., MELLIAR-SMITH, P. M., AND RAMAKRISHNA, Y.S. 1993. A ~graphical interval logic for specifying concurrent systems. Tech. Rep. TRCS 93-16, Computer ~Science Dept., Univ. of California, Santa Barbara, Calif. Google ScholarGoogle Scholar
  5. ~DILLON, L. K., Ku~Y, G., MOSER, L. E., MELLIAR-SMITH, P. M. AND RANIAKRISHNA, Y. S. 1992. ~Graphical specifications for concurrent software systems. In Proceedings of the 14th IEEE ~International Conference on So/tware Engmeerzng. IEEE, New York, 213-224. Google ScholarGoogle Scholar
  6. ~ABBAY, D. M. 1987. The declarative past and imperative future. In Proceedings of the ~Conference on Temporal Logic in Specification. Lecture Notes in Computer Science, vol 398, ~Springer-Verlag, 409-448. Google ScholarGoogle Scholar
  7. ~GIACALONE, A., AND SMOLKA, S.A. 1988. Integrated environments for formally well-founded ~design and simulation of concurrent systems. IEEE Trans. Softw. Eng. f4, 6 (June), 787-801. Google ScholarGoogle Scholar
  8. ~GILLETT, W. U., AND KIMURA, T.D. 1986. Parsing two-dimensional languages. In Proceedings ~of the IEEE lOth Internatzonal Conference of Computer Software and Applications. IEEE, New ~York, 472-477.Google ScholarGoogle Scholar
  9. ~GOUN, E. AND RErSS, S P. 1989. The specification of visual language syntax. In Proceedings of ~the IEEE Workshop on Visual Languages, IEEE, New York, 105-110.Google ScholarGoogle Scholar
  10. ~HALPF~RN, J. Y., AND SHOHAM, Y. 1991. A propositional modal logic of time intervals. J. ACM ~38, 4 (Oct.), 935 962. Google ScholarGoogle Scholar
  11. ~HALPERN, J. Y., MANNA, Z., AND MOSZKOWSKI, B. 1983. A hardware semantics based on ~temporal intervals. In Proceedings of the lOth fnternatwnal Conference on Automata, Lan- ~guages and Programming. Eur. Assoc. for Theoretical Computer Science, 278-291. Google ScholarGoogle Scholar
  12. ~HAREL, D. 1987. Statecharts: A visual formalism for complex systems Scl. Comput. Program. ~8, 3 (June), 231-274. Google ScholarGoogle Scholar
  13. ~HAREL, D., LACHOVER, H., NAAMAD, A., PNUELI, A., POLITI, M., SHERMAN, R., SHTULL-TRAURING, A., ~Al~D TRAKI/TENBROT, M. 1990. STATEMATE: A working environment or the development of ~complex reactive systems. IEEE Trans. Softw. Eng. 16, 4 (Apr.), 403-414. Google ScholarGoogle Scholar
  14. ~KOOMEN, J. A. G.M. 1987. The TIMELOGIC temporal reasoning system. Tech. Rep., Dept. of ~Computer Science, Umv. of Rochester, N.Y. (Revised March 1989).Google ScholarGoogle Scholar
  15. ~KUTTY, G. 1993. A tool for the interactive generation of Graphical Interval Logic formulas. ~Tech. Rep, 9307, Dept. of Electrical and Computer Engineering, Univ. of California, Santa ~Barbara, Cahf.Google ScholarGoogle Scholar
  16. ~KUTTY, C-.~ MOSER~ L. E.~ MELLIAR-SMITH, P. M., DILLON~ L. K.~ AND RAMAKRISHNA, Y S. 1994. ~First-order future interval logic. In Proceedings of the 1st International Conference on Tempo- ~ral Logic. Lecture Notes in Artificial Intelligence, vol. 827~ Springer-Verlag, Berlin, 195-209. Google ScholarGoogle Scholar
  17. ~KUTTY, G., RAMAKRISHNA, Y. S , MOSER, L. E., DILLON, L. K., AND MELLIAR-SMITH, P.M. 1993. A ~graphical interval logic toolset for verifying concurrent systems. In Proceedings of the 4th ~Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. ~Springer-Veriag, Berlin, 138-153. Google ScholarGoogle Scholar
  18. ~LAMPORT, L. 1990. A temporal logic of actions. Tech. Rep. 57, DEC Systems Research Center, ~Palo Alto, Calif.Google ScholarGoogle Scholar
  19. ~LAMPOm', L. 1983. What good is temporal logic? In Proceedings of the IFIP Congress. IFIP, ~Washington, D.C., 657-668.Google ScholarGoogle Scholar
  20. ~LANDIN, P. J. 1966. The next 700 programming languages. Commun. ACM. 9, 3 (Mar.) ~157 166. Google ScholarGoogle Scholar
  21. ~MANNA, Z., AND PNUEL~, A. 1987. Specification and verification of concurrent programs by ~V-automata. In Proceedings of the Conference on Temporal Logic in Specification. Lecture ~Notes in Computer Science, vol. 348, Springer-Verlag, Berlin, 124-187. Google ScholarGoogle Scholar
  22. ~MANNA, Z., AND PNUELI, A. 1981. Verification of concurrent programs: The temporal frame- ~work. In The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore, Eds. ~Academic Press, New York, 215-273.Google ScholarGoogle Scholar
  23. ~MELLIAR-SMITH, P.M. 1988. A graphical representation of interval logic. In Proceedings of the ~International Conference on Concurrency. Lecture Notes in Computer Science, vol. 335, ~Springer-Verlag, Berlin, 106 120. Google ScholarGoogle Scholar
  24. ~MYERS, B. A., GUISE, D. A., DANNENRERG, R. B., VANDER ZANDEN, B., KOSBIE, D. S., PERVIN, E., ~M1CKISH, A., AND MARCHAL, P. 1990. Garnet: Comprehensive support for graphical highly ~interactive user interfaces. IEEE Comput. 18, 11 (Nov.), 71 85. Google ScholarGoogle Scholar
  25. ~PLAISTED, D. 1983. A low level language for obtaining decision procedures for classes of ~temporal logics. In Proceedings of the CMU Workshop on Logics of Programs. Lecture Notes in ~Computer Science, Vol. 164. Springer-Verlag, Berlin, 403-420. Google ScholarGoogle Scholar
  26. ~PRATT, V. 1986. Modeling concurrency with partial orders. Int. J. Parall. Program. 15, 1, ~33-71. Google ScholarGoogle Scholar
  27. ~RAMAKRISHNA, Y.S. 1993. Interval Logics for Temporal Specification and Verification. Ph.D. ~thesis, Dept. of Computer and Electrical Engineering, Univ. of California, Santa Barbara, ~Calif. Google ScholarGoogle Scholar
  28. ~RAMAKRISHNA, Y. S., DILLON, L. K., MOSER, L. E., MELLIAR-SMITH, P. M., AND KUTTY, G. 1993a. ~A real-time interval logic and its decision procedure. In Proceedings of the 13th Conference on ~the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in ~Computer Science, vol. 761. Springer-Verlag, Berlin, 173-192. Google ScholarGoogle Scholar
  29. ~RAMAKRISHNA, Y. S., MELLIAR-SMITH, P. M., MOSER, L. E., DILLON, L. K., AND KUTTY, G. 1993b. ~Really visual temporal reasoriing. In Proceedings of the 14th IEEE Real-Time Systems Sympo- ~sium, IEEE, New York, 262-273.Google ScholarGoogle Scholar
  30. ~RAMAKRISHNA, Y. S., DILLON, J. K., MOSER, L. E., MELLIAR-SMITH, P. M. AND NUTTY, G. 1992. ~An automata-theoretic decision procedure for future interval logic. In Proceedings of the 12th ~Conference on the Foundations of Software Technology and Theoretical Computer Science. ~Lecture Notes in Computer Science, vol. 652. Springer-Verlag, Berlin, 51 67. Google ScholarGoogle Scholar
  31. ~SCHLC)R, R., AND DAMM, W. 1993. Specification of system-level hardware designs using timing ~diagrams. In Proceedings of the European Conference on Design Automation a,d European ~Event in ASIC Design. IEEE Computer Society Press, Los Alamitos, Calif., 518-524.Google ScholarGoogle Scholar
  32. ~SCHWARTZ, R. L., MELLIAR-SMiTH, P. M., AND VOGT, F.H. 1983. An interval logic for higher-level ~temporal reasoning. In Procee&ngs of the 2nd ACM Symposium on the Principles of Dis- ~tr~buted Computing. ACM, New York, 173 186. Google ScholarGoogle Scholar
  33. ~WOLPER, P. 1987. On the relation of programs and computations to models of temporal logic. ~In Proceedings of the Conference on Temporal Logic in Specification. Lecture Notes in ~Computer Science, vol. 398. Springer-Verlag, Berlin, 75-123. Google ScholarGoogle Scholar

Index Terms

  1. A graphical interval logic for specifying concurrent systems

              Recommendations

              Reviews

              Andreas Ramses Heckler

              A graphical interval logic called “GIL” and the “GIL tool set” are described. GILs name stems from its two essential characteristics: the graphical syntax and the “interval-based” semantics of GIL formulas. GIL specifications are intended to be more readable than textual specifications and more comprehensible than specifications founded on standard temporal logics. The purpose of the GIL tool set is highlighted by the following quotation: The GIL tool set is a prototype. …Both the logic and the display of formulas have evolved based on our experience with the tools. We expect this process of experimentation and revision to continue as we refine the current tool set into a working environment for specification, validation, and design of concurrent software systems. A robust, user-friendly environment will permit empirical studies needed to determine whether software designers find a visual logic, such as GIL, easier to use than a textual logic. The GIL tool set includes a visual (syntax-directed) editor (GILED), a proof checker, and a model generator. The logic has a formal model-theoretic semantics and is as expressive as propositional temporal logic with until and without next [1]. Unfortunately, it is not possible to give an impression of GILs graphical syntax in this review. To get an impression of its interval-based semantics, consider the most fundamental form of a GIL-formula F in its textual version: F:= [ f &vbm0; f,g ) F 1 . The essential parts of F are the interval I:= [ f &vbm0; f,g ) (where f and g are GIL-formulas) and the GIL-formula F 1 . Together they form the new GIL-formula F . Evaluation of GIL-formulas needs a given (infinite) sequence s of states and a given index i , and yields either true or false. In our case, F s,i = true holds if the following conditions are fulfilled. Let li be the least index such that f s,l = true, let rl be the least index such that g s,r = true, and let s be the subsequence of s determined by l and r , that is, s :=s l ,s l+1 ,&ldots;,s r-1 ,s r-1 ,s r-1 ,&ldots; Then F l s ,0 = true must hold. The meaning of a GIL-formula F depends on further (graphical) syntactic details—a formula F describes either all sequences s such that F s,0 = true holds or all sequences s such that F s,i = true holds for all i . The paper consists of eight main sections: “Introduction,” “Graphical Interval Logic,” “An Example Specification,” “Graphical Proofs of System Properties,” “The Graphical Interval Logic Tool Set, “Implementation of the Tool Set,” “Related Work,” and “Conclusion.” Appendix A contains a formal definition of the syntax and its model-theoretic semantics. The paper has no serious deficiencies, but readers, especially those who are not familiar with the topic, should not ignore the appendix. The best way to understand the concepts of GIL is to read section 2 (which gives an informal introduction) and A ppendix A (which gives the formal definitions) simultaneously.

              Access critical reviews of Computing literature here

              Become a reviewer for Computing Reviews.

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader