On visual formalisms

ABSTRACT

The higraph, a general kind of diagramming object, forms a visual formalism of topological nature. Higraphs are suited for a wide array of applications to databases, knowledge representation, and, most notably, the behavioral specification of complex concurrent systems using the higraph-based language of statecharts.

REFERENCES

• 1: C. Berge, Graphs and Hypergraphs, Elsevier Science Ltd, 1985
• 2: Gérard Berry , Laurent Cosserat, The ESTEREL Synchronous Programming Language and its Mathematical Semantics, Seminar on Concurrency, Carnegie-Mellon University, p.389-448, July 09-11, 1984
• 3: N. Biggs , E. K. Lloyd , R. J. Wilson, Graph Theory, 1736-1936, Clarendon Press, New York, NY, 1986
• 4: B rachman, R.J. On the epistemological status of semaniic networks. I n Associative Networks: Representation and Use of Knowledge by Computer, N.V. Findler, Ed. Academic Press, New York, 1979, pp. 3-50.
• 5: Luca Cardelli, A semantics of multiple inheritance., Proc. of the international symposium on Semantics of data types, p.51-67, July 1984, Sophia-Antipolis, France
• 6: Eugene Charniak , Drew McDermott, Introduction to artificial intelligence, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1985
• 7: Peter Pin-Shan Chen, The entity-relationship model—toward a unified view of data, ACM Transactions on Database Systems (TODS), v.1 n.1, p.9-36, March 1976 [doi>10.1145/320434.320440]
• 8: Jeff Conklin, Hypertext: an introduction and survey, Computer, v.20 n.9, p.17-41, Sept. 1987 [doi>10.1109/MC.1987.1663693]
• 9: Davis, P.J., Anderson, J.A. Nonanalytic aspects on mathematics and their implication on research and education. SIAM Review 21, 1 (Jan. 1979), 112-127.
• 10: Clesio Saraiva dos Santos , Erich J. Neuhold , Antonio L. Furtado, A Data Type Approach to the Entity-Relationship Approach, Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design, p.103-119, January 1980
• 11: Dugundji, J. Topology. Allyn and Bacon, Boston, Mass., 1966.
• 12: Euler, L. Solutio problematis ad geometriam situs pertinentis. Comm. Acad. Sci. Imp. Petropol. 8 (1736), 128-140.
• 13: Euler, L. Lettres il une Princesse d'Allemagne. Vol. 2. 1772 (letters 102-108).
• 14: Ronald Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, Journal of the ACM (JACM), v.30 n.3, p.514-550, July 1983 [doi>10.1145/2402.322390]
• 15: Ronald Fagin , Alberto O. Mendelzon , Jeffrey D. Ullman, A simplied universal relation assumption and its properties, ACM Transactions on Database Systems (TODS), v.7 n.3, p.343-360, Sept. 1982 [doi>10.1145/319732.319735]
• 16: al-Fedaghi, S.S. An entity-relationship approach to modelling petroleum engineering database. In Entity-Relationship Approach to Software Engineering, C.G. Davis et al., Eds. Elsevier Science Publishers, Amsterdam, 1983, pp. 761-779.
• 17: Nicholas V. Findler, Associative Networks: The Representation and Use of Knowledge by Computers, Academic Press, Inc., Orlando, FL, 1979
• 18: Fitter, M., and Green, T.R.G. When do diagrams make good computer languages? Int. J. Man-Mach. Stud. 11, 2 (March 1979), 235-261.
• 19: Gardner, M. Logic Machines and Diagrams. 2nd ed. University of Chicago Press, Chicago, I11., 1982.
• 20: Green, T.R. Pictures of programs and other processes, or how to do things with lines. Behav. Inf. Technol. 1, 1 (1982), 3-36.
• 21: David Harel, Statecharts: A visual formalism for complex systems, Science of Computer Programming, v.8 n.3, p.231-274, June 1, 1987 [doi>10.1016/0167-6423(87)90035-9]
• 22: D. Harel , A. Pnueli, On the development of reactive systems, Logics and models of concurrent systems, Springer-Verlag New York, Inc., New York, NY, 1989
• 23: Hard, D., Pnueli, A., Schn,idt, J.P., and Sherman, R. On the formal semantics of statecharts. In Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (Ithaca, N.Y., June 22-24}. IEEE Press, New York, 1987, pp. 54-64.
• 24: D. Harel , H. Lachover , A. Naamad , A. Pnueli , M. Politi , R. Sherman , a. Shtul-Trauring, Statemate: a working environment for the development of complex reactive systems, Proceedings of the 10th international conference on Software engineering, p.396-406, April 11-15, 1988, Singapore
• 25: Hendrix, G.G. Expanding the utility of semantic networks through partitioning. In Proceedings of the 4th International Conference on Artificial Intelligence (Tbilisi, Georgia, USSR, Sept. 3-8). International Joint Council on Artificial Intelligence, Cambridge, Mass., 1975, pp. 115-121.
• 26: C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
• 27: John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 28: i-Logic. The languages of STATEMATE. Tech. Rep., i-Logix, Burlington, Mass., 1987.
• 29: Kahana, C.A. Statecharts with overlapping states. M.S. thesis, Dept. of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan, Israel, 1986 (in Hebrew).
• 30: Lefschetz, S. Introduction to Topology. Princeton University Press, Princeton, N.J., 1949.
• 31: David Maier , Jeffrey D. Ullman, Connections in acyclic hypergraphs: extended abstract, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California [doi>10.1145/588111.588118]
• 32: Z. Monna , A. Pnueli, Specification and verification of concurrent programs by A∀automata, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.1-2, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41626]
• 33: James Martin , Carma McClure, Diagramming techniques for analysts and programmers, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
• 34: McSkimin, J.R., and Minker. J. A predicate calculus based semantic network for deductive searching. In Associative Networks: Representation and Use of Knowledge by Computer, N.V. Findler, Ed. Academic Press, New York, 1979, pp. 205-238.
• 35: R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
• 36: Nakano, R. Integrity checking in a logic-oriented ER model. In Entity-Relationship Approach to Software Engineering, C.G. Davis et al., Eds. Elsevier Science Publishers, Amsterdam, 1983, pp. 551-564.
• 37: N. J. Nilsson, Principles of artificial intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1980
• 38: Susan Owicki , Leslie Lamport, Proving Liveness Properties of Concurrent Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.455-495, July 1982 [doi>10.1145/357172.357178]
• 39: A Pnueli, Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, Current trends in concurrency. Overviews and tutorials, Springer-Verlag New York, Inc., New York, NY, 1986
• 40: Quillian, M.R. Semantic memory. In Semantic Information Processing, M. Minsky, Ed. MIT Press, Cambridge, Mass., 1968, pp. 227-270.
• 41: Wolfgang Reisig, Petri nets: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
• 42: Schiffner, G., and Schuermann, P. Multiple views and abstractions with an extended-entity-relationship model. Comput. Lang. 4, 3/4 (1979), 139-154.
• 43: Schmid, C.F. Statistical Graphics: Design Principles and Practices. Wiley, New York, 1983.
• 44: Shapiro, S.C. A net structure for semantic information storage, deduction, and retrieval. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence. 1971, pp. 512-523.
• 45: David S. Touretzky, The mathematics of inheritance systems, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1986
• 46: Edward R. Tufte, The visual display of quantitative information, Graphics Press, Cheshire, CT, 1986
• 47: Tygar, J.D.. and Wing. J.M. Visual specification of security constraints. In The IEEE Workshop on Visual Languages (Link6ping, Sweden, Aug. 19-21). IEEE Press, New York, 1987.
• 48: Venn, J. On the diagrammatic and mechanical representation of propositions and reasonings. Phil. Mag. (1880), 123.
• 49: Venn, J. Symbolic Logic. 2nd ed. London, 1894. (Reprinted by Chelsea, Bronx, N.Y., 1971.}
• 50: Woods, W.A. What's in a link? Foundations for semantic networks. In Representation and Understanding, D.G. Bobrow and A.M. Collins, Eds. Academic Press, New York, 1975, pp. 35-82.
• 51: Pamela Zave, A distributed alternative to finite-state-machine specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.1, p.10-36, Jan. 1985 [doi>10.1145/2363.2365]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE

Additional Classification:
  C. Computer Systems Organization

  D. Software
  D.2 SOFTWARE ENGINEERING

  E. Data

  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

  H. Information Systems
  H.1 MODELS AND PRINCIPLES

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.4 Knowledge Representation Formalisms and Methods
          Subjects: Semantic networks

General Terms:
Design, Languages, Theory