Sciweavers

2467 search results - page 54 / 494
» Finite State Machines
Sort
View
92
Voted
AGENTCL
2000
Springer
15 years 4 months ago
Using Colored Petri Nets for Conversation Modeling
Conversations are a useful means of structuring communicative interactions among agents. The value of a conversation-based approach is largely determined by the conversational mod...
R. Scott Cost, Ye Chen, Timothy W. Finin, Yannis L...
ERSHOV
1999
Springer
15 years 4 months ago
Enhanced Control Flow Graphs in Montages
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
Matthias Anlauff, Philipp W. Kutter, Alfonso Piera...
VTS
1998
IEEE
97views Hardware» more  VTS 1998»
15 years 4 months ago
On the Identification of Optimal Cellular Automata for Built-In Self-Test of Sequential Circuits
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...
Fulvio Corno, Nicola Gaudenzi, Paolo Prinetto, Mat...
104
Voted
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
15 years 4 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt
102
Voted
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
15 years 4 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao