3220 search results - page 206 / 644 » Constrained Graph Processes |
204
click to vote
FM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
133
click to vote
ACL
2000
15 years 7 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
168
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
155
click to vote
CEEMAS
2001
Springer
15 years 11 months ago
2001
Springer
The paper focuses on the application of a multi-agent system for a management process. The presented system is working on the structure of graph, where nodes represent decision mod...