Automatic generation of Chu space model expressions for verification

We present an algorithm for automatic generation of behavioral models of non-iterated systems from a structural Verilog specification. The models are represented as Chu spaces over the set of system events, and are used for verifying system behavior. The correctness and time complexity of the presented algorithm are briefly discussed along with a small example.

[1]  Gordon D. Plotkin,et al.  Full completeness of the multiplicative linear logic of Chu spaces , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[2]  Vaughan R. Pratt,et al.  The Stone gamut: a coordinatization of mathematics , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[4]  Zoltán Ésik,et al.  Free Shuffle Algebras in Language Varieties , 1996, Theor. Comput. Sci..

[5]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[6]  V. Pratt,et al.  Linear Logic For Generalized Quantum Mechanics , 1992, Workshop on Physics and Computation.

[7]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[8]  Vaughan R. Pratt,et al.  Chu spaces: automata with quantum aspects , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

[9]  R. Nunna,et al.  Modeling and verification of iterated systems and protocols , 2001, Proceedings of the 44th IEEE 2001 Midwest Symposium on Circuits and Systems. MWSCAS 2001 (Cat. No.01CH37257).

[10]  L. Ivanov,et al.  Modeling and analysis of noniterated systems: an approach based upon series-parallel posets , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[11]  Vaughan R. Pratt,et al.  Higher dimensional automata revisited , 2000, Mathematical Structures in Computer Science.

[12]  Vaughan R. Pratt,et al.  Chu Spaces and Their Interpretation as Concurrent Objects , 1995, Computer Science Today.

[13]  Vaughan R. Pratt,et al.  The Duality of TIme and Information , 1992, CONCUR.

[14]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[15]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[16]  Yukihide Takayama.  Extraction of Concurrent Processes from Higher Dimensional Automata , 1996, CAAP.

[17]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[18]  C. A. Petri.  Fundamentals of a Theory of Asynchronous Information Flow , 1962, IFIP Congress.

[19]  Vaughan R. Pratt,et al.  Gates accept concurrent behavior , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[20]  Vaughan R. Pratt.  Rational Mechanisms and Natural Mathematics , 1995, TAPSOFT.

[21]  Jay Loren Gischer,et al.  Partial orders and the axiomatic theory of shuffle (pomsets) , 1985 .

[22]  Vaughan Pratt,et al.  Chu spaces as a semantic bridge between linear logic and mathematics , 2003, Theor. Comput. Sci..

[23]  Vineet Gupta,et al.  Chu spaces: a model of concurrency , 1994 .

[24]  Phan Cong Vinh,et al.  Semantics of RTL and validation of synthesized RTL designs using formal verification in reconfigurable computing systems , 2005, 12th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'05).