139
Voted
ACSC
2003
IEEE
15 years 7 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
111
Voted
ACSD
2001
IEEE
15 years 7 months ago
2001
IEEE
163
Voted
ACSD
2001
IEEE
15 years 7 months ago
2001
IEEE
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
111
click to vote
ACSD
2001
IEEE
15 years 7 months ago
2001
IEEE
We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two di erent types of non-interleaving semantics of such Petri nets, the a-po...
135
Voted
ACSD
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications. The method is based on a structural encoding of the system in such ...