论文信息 - Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable

Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable

Parametric timing constraints are expressed naturally in timing diagram logics. Algorithmic verification of parametrically constrained timing properties is a difficult problem known to be undecidable in most general cases. This paper establishes that a class of parametrically constrained timing properties can be verified algorithmically against finite-state systems; alternatively stated containment by a regular language is shown decidable for a class of language properties (regular and non-regular) expressible in our timing diagram logic.

Kathi Fisler

[1] W. Grass,et al. Transformation of timing diagram specifications into VHDL code , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.

[2] Tao Jiang,et al. New Decidability Results Concerning Two-way Counter Machines and Applications , 1993, ICALP.

[3] Farhad Mavaddat,et al. Consistency and satisfiability of waveform timing specifications , 1991, Networks.

[4] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[5] R. Schlor. A prover for VHDL-based hardware design , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.

[6] Steven D. Johnson,et al. A unified approach to hardware verification through a heterogeneous logic of design diagrams , 1996 .

[7] Hans Peter Amann,et al. High-level modeling using extended timing diagrams - A formalism for the behavioral specification of digital hardware , 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.

[8] Eduard Cerny,et al. Integrating Behavior and Timing in Executable Specifications , 1993, CHDL.

[9] Thomas A. Henzinger,et al. Parametric real-time reasoning , 1993, STOC.