FSM model abstraction for analog/mixed-signal circuits by learning from I/O trajectories

Authors:
Chenjie Gu;Jaijeet Roychowdhury
Affiliations:
University of California, Berkeley;University of California, Berkeley
Venue:
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Year:
2011

Citing 7
Cited 2

Learning regular sets from queries and counterexamples

Information and Computation
On Discrete Modeling and Model Checking for Nonlinear Analog Systems

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Hybrid systems: computation and abstraction

Hybrid systems: computation and abstraction
Integration Testing of Components Guided by Incremental State Machine Learning

TAIC-PART '06 Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques
Model reduction via projection onto nonlinear manifolds, with applications to analog circuits and biochemical systems

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning

Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning
A trajectory piecewise-linear approach to model order reduction and fast simulation of nonlinear circuits and micromachined devices

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

DAE2FSM: automatic generation of accurate discrete-time logical abstractions for continuous-time circuit dynamics

Proceedings of the 49th Annual Design Automation Conference
Trajectory-directed discrete state space modeling for formal verification of nonlinear analog circuits

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstraction of circuits is desirable for faster simulation and high-level system verification. In this paper, we present an algorithm that derives a Mealy machine from differential equations of a circuit by learning input-output trajectories. The key idea is adapted from Angluin's DFA (deterministic finite automata) learning algorithm [1] that learns a DFA from another DFA. Several key components of Angluin's algorithm are modified so that it fits in our problem setting, and the modified algorithm also provides a reasonable partitioning of the continuous state space as a by-product. We validate our algorithm on a latch circuit and an integrator circuit, and demonstrate that the resulting FSMs inherit important behaviors of original circuits.