Scheduling of signal transition graphs under timing constraints

Author

Baake, Uwe ; Huss, Sorin A.

Author_Institution

Dept. of Comput. Sci., Tech. Univ. of Darmstadt, Germany

Volume

1

fYear

1994

fDate

30 May-2 Jun 1994

Firstpage

205

Abstract

In this paper the introduction of interval based timing constraints in Signal Transition Graphs (STGs) is discussed. As a novel contribution we propose a general method to analyse these timing constraints according to different firing rules in cyclic STG. This method is based on the formulation and solution of an optimization problem. Results are presented for establishing the precedence relation of transitions, which is important in consideration of the synthesis process of asynchronous communication protocols

Keywords

Petri nets; asynchronous circuits; circuit CAD; circuit analysis computing; circuit optimisation; high level synthesis; logic design; scheduling; asynchronous communication protocols; cyclic STG; firing rules; interval based timing constraints; logic circuit design; optimization problem; precedence relation; signal transition graphs; Asynchronous circuits; Circuit synthesis; Computer science; Constraint optimization; Delay; Fires; Logic circuits; Processor scheduling; Protocols; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on

Conference_Location

London

Print_ISBN

0-7803-1915-X

Type

conf

DOI

10.1109/ISCAS.1994.408791

Filename

408791