Synthesis of reactive(1) designs
2012
We consider the problem of synthesizing digital designs from their ltl specification. In spite of the theoretical double exponential lower bound for the general case, we show that for many expressive specifications of hardware designs the problem can be solved in time N3, where N is the size of the state space of the design. We describe the context of the problem, as part of the Prosyd European Project which aims to provide a property-based development flow for hardware designs. Within this project, synthesis plays an important role, first in order to check whether a given specification is realizable, and then for synthesizing part of the developed system.
Keywords:
- State space
- Combinatorics
- Theoretical computer science
- Spite
- Double exponential function
- Upper and lower bounds
- Temporal logic
- Circuit design
- Computer science
- Realizability
- Software development
- Of the form
- Arbiter
- Atomic sentence
- Game theory
- Quadratic equation
- Discrete mathematics
- Reactive system
- Formal specification
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
87
References
675
Citations
NaN
KQI