3220 search results - page 282 / 644 » Constrained Graph Processes |
196
click to vote
MODELS
2009
Springer
15 years 11 months ago
2009
Springer
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
140
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
195
click to vote
APN
2008
Springer
15 years 8 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
166
click to vote
FORTE
1994
15 years 8 months ago
1994
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
181
click to vote
JMLR
2006
15 years 6 months ago
2006
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...