Formalising VERILOG

This paper defines a non-trivial subset of VERILOG using a Plotkin-style operational semantics. We discuss the algebraic properties of programs based on the notion of bisimulation.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Michael J. C. Gordon,et al.  The semantic challenge of Verilog HDL , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Gerardo Schneider,et al.  Towards an Operational Semantics of Verilog , 1998 .