Modeling and Verification of Circuit with Stable-Event

In recent years, the state based method has been common employed in formal verification. However, the event structures hardly adopted which is more direct and natural than finite state machines when discribing the behavior of a circuit or system. In this paper, to describe the circuit accurately, stable event is proposed when the model extended bundle event structures, EBES in short, is equipped. From the signal transition waveform four actions can be obtained, two of them are used to express the stable signal, stable up and stable down. The stable event denotes the occured stable action. The EBES of primitive logic gates well be presented, and then the complex logic cell’s EBES well be built in a compositional way.

[1]  Edmund M. Clarke,et al.  Automatic verification of asynchronous circuits using temporal logic , 1986 .

[2]  Daniele Varacca,et al.  Typed Event Structures and the π-Calculus – Extended , 2022 .

[3]  Marta Z. Kwiatkowska,et al.  Opportunities and Challenges in Process-algebraic Verification of Asynchronous Circuit Designs , 2006, Electron. Notes Theor. Comput. Sci..

[4]  Igor Buzhinsky,et al.  Exact finite-state machine identification from scenarios and temporal properties , 2016, International Journal on Software Tools for Technology Transfer.

[5]  Marly Roncken,et al.  Semi-modular delay model revisited in context of relative timing , 2015 .

[6]  Kenneth S. Stevens,et al.  Practical verification and synthesis of low latency asynchronous systems , 1994 .

[7]  Cristian Gratie,et al.  Composition Colored Petri Nets for the Refinement of Reaction-based Models , 2016, SASB.

[8]  Kenneth S. Stevens,et al.  Modeling and verifying circuits using generalized relative timing , 2005, 11th IEEE International Symposium on Asynchronous Circuits and Systems.

[9]  Joost-Pieter Katoen,et al.  Quantitative and Qualitative Extensions of Event Structures , 1996 .

[10]  Vladimir Estivill-Castro,et al.  Model Checking of Transition-Labeled Finite-State Machines , 2011, FGIT-ASEA/DRBC/EL.

[11]  Anna Slobodová,et al.  A flexible formal verification framework for industrial scale validation , 2011, Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMPCODE2011).

[12]  Marly Roncken,et al.  Modular Timing Constraints for Delay-Insensitive Systems , 2016, Journal of Computer Science and Technology.

[13]  Nikola Bogunovic,et al.  Model checking procedures for infinite state systems , 2006, 13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06).

[14]  Alexandre Petrenko,et al.  Checking Experiments for Symbolic Input/Output Finite State Machines , 2016, 2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW).

[15]  Ran Ginosar,et al.  Relative timing , 1999, Proceedings. Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[16]  Daniele Varacca,et al.  Typed Event Structures and the p-Calculus , 2006 .

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

[18]  Laurent Fesquet,et al.  Formal Verification of C-element Circuits , 2011, 2011 17th IEEE International Symposium on Asynchronous Circuits and Systems.