826 search results - page 109 / 166 » Resolving Concurrent Interactions |
108
click to vote
APN
2006
Springer
15 years 7 months ago
2006
Springer
The product of safe Petri nets is a well known operation : it generalizes to concurrent systems the usual synchronous product of automata. In this paper, we consider a more general...
129
click to vote
ATAL
2003
Springer
15 years 6 months ago
2003
Springer
Debugging multi-agent systems, which are concurrent, distributed, and consist of complex components, is difficult, yet crucial. In earlier work we have proposed mechanisms whereby...
153
click to vote
AADEBUG
2005
Springer
15 years 5 months ago
2005
Springer
Increased reuse of software components has led to a software mishmash as existing packages are used as building blocks for new systems. Current debuggers cannot cope with the intr...
125
click to vote
SFP
2001
15 years 4 months ago
2001
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
129
click to vote
AIPS
1994
15 years 4 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...