Sciweavers

936 search results - page 106 / 188
» The Synthesis Problem of Netcharts
Sort
View
114
Voted
BIRTHDAY
2004
Springer
15 years 9 months ago
Engineers Don't Search
Abstract. This paper is on the automation of knowledge-intensive tasks in engineering domains; here, the term “task” relates to analysis and synthesis tasks, such as diagnosis ...
Benno Stein
127
Voted
FSTTCS
2004
Springer
15 years 9 months ago
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
Paul Gastin, Benjamin Lerman, Marc Zeitoun
111
Voted
DAC
1996
ACM
15 years 7 months ago
A Technique for Synthesizing Distributed Burst-mode Circuits
We offer a technique to partition a centralized control-flow graph to obtain distributed control in the context of asynchronous highlevel synthesis. The technique targets Huffman-...
Prabhakar Kudva, Ganesh Gopalakrishnan, Hans M. Ja...
105
Voted
FSTTCS
2008
Springer
15 years 4 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
107
Voted
FSTTCS
2008
Springer
15 years 4 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn