A graphic language based on timing diagrams

We present a new graphic language which can serve, for instance, as models for VLSI and control systems. Its primitives are based on standard timing diagrams, and this is a great advantage over other formalisms since designers can rapidly master it. The semantics is rigorously defined in the formalism of the theory of automata on infinite words. Using this formalism, we are able to give a rather precise upper-bound on the expressive power of our graphic language in terms of a language theoretic measure, theconcatenation level. A detailed example is presented.

[1]  Viktor Cingel.  A Graph-Based Method for Timing Diagrams Representation and Verification , 1993, CHARME.

[2]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Louise E. Moser,et al.  Visual Specifications for Temporal Reasoning , 1994, J. Vis. Lang. Comput..

[4]  Albert Benveniste,et al.  CAD environment for real-time control system , 1989, 1989 American Control Conference.

[5]  Eduard Cerny,et al.  A stimulus/response system based on hierarchical timing diagrams , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[6]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[7]  Janusz A. Brzozowski,et al.  The Dot-Depth Hierarchy of Star-Free Languages is Infinite , 1978, J. Comput. Syst. Sci..

[8]  John A. McDermid,et al.  Using Diagrams to Give a Formal Specification of Timing Constraints in Z , 1992, Z User Workshop.

[9]  Werner Grass,et al.  Introducing structure into behavioural descriptions obtained from timing diagram specifications , 1993, Microprocess. Microprogramming.

[10]  Gaetano Borriello,et al.  Formalized timing diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[11]  Werner Damm,et al.  VHDL/S - integrating statecharts, timing diagrams, and VHDL , 1993, Microprocess. Microprogramming.

[12]  Dominique Perrin,et al.  First-Order Logic and Star-Free Sets , 1986, J. Comput. Syst. Sci..

[13]  William W. Wadge,et al.  Lucid - A Formal System for Writing and Proving Programs , 1976, SIAM J. Comput..

[14]  Wolf-Dieter Tiedemann.  Bus Protocol Conversion: from Timing Diagrams to State Machines , 1991, EUROCAST.

[15]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.