Component Refinement and CSC Solving for STG Decomposition

Schaefer, Mark; Vogler, Walter

doi:10.1007/978-3-540-31982-5_22

Cited by 7 publications

(2 citation statements)

References 7 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, inputs are always allowed implicitly and, in effect, treated just like in IA-refinement. Due to the output-must-transitions in the MIA-setting, MIA-refinement can model, e.g., STG-bisimilarity [13] for digital circuits.…”

Section: Definition 15 (Modal Interface Automatonmentioning

confidence: 99%

Modal Interface Automata

Lüttgen

Vogler

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

De Alfaro and Henzinger's Interface Automata (IA) and Nyman et al.'s recent combination IOMTS of IA and Larsen's Modal Transition Systems (MTS) are established frameworks for specifying interfaces of system components. However, neither IA nor IOMTS consider conjunction that is needed in practice when a component satisfies multiple interfaces, while Larsen's MTS-conjunction is not closed. In addition, IOMTS-parallel composition exhibits a compositionality defect. This paper defines conjunction on IA and MTS and proves the operators to be 'correct', i.e., the greatest lower bounds wrt. IA-and resp. MTS-refinement. As its main contribution, a novel interface theory called Modal Interface Automata (MIA) is introduced: MIA is a rich subset of IOMTS, is equipped with compositional parallel and conjunction operators, and allows a simpler embedding of IA than Nyman's. Thus, it fixes the shortcomings of related work, without restricting designers to deterministic interfaces as Raclet et al.'s modal interface theory does.

show abstract

Section: Definition 15 (Modal Interface Automatonmentioning

confidence: 99%

Modal Interface Automata

Lüttgen

Vogler

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…One of the main interests of the proposed approach is the capability of handling large STGs that are generated from hardware description languages (HDLs) such as Tangram [1] and Balsa [10]. Moreover, the approach presented in this paper can be combined with recent approaches for decomposition [30], widening the capabilities of applying logic synthesis in a complete synthesis flow. In fact, the main advantage of these HDLs is that they are supported by complete synthesis flows using the so-called syntax-directed translation (SDT) paradigm.…”

Section: Contributionsmentioning

confidence: 99%

Encoding Large Asynchronous Controllers With ILP Techniques

Carmona

Cortadella

2008

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers specified with signal transition graphs. The method is based on the structural theory of Petri nets and uses integer-linear programming to insert state signals in locations that guarantee the consistency and absence of critical races. The structural nature of the proposed method makes it conservative, i.e., a solution cannot be guaranteed, even if it exists. Nevertheless, the experiments show that this limitation did not preclude finding a solution for all the examples presented in this paper. The method can be customized for area or delay optimization. The experimental results confirm the quality of the circuits, as compared with state-based methods. They also show the significant benefits that could be obtained if logic synthesis would be incorporated in synthesis frameworks that generate controllers by syntax-directed translation.

show abstract