|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.wis.jtlv.lib.games.GR1GameAlg
public class GR1GameAlg
Nir Piterman, Amir Pnueli, and Yaniv Sa’ar. Synthesis of Reactive(1) Designs. In VMCAI, pages 364–380, Charleston, SC, January 2006.
To execute, create an object with two Modules, one for the system and the
other for the environment, and then just extract the strategy through
GR1Game.printWinningStrategy()
.
Field Summary | |
---|---|
BDD[][][] |
x_mem
|
BDD[][] |
y_mem
|
BDD[] |
z_mem
|
Constructor Summary | |
---|---|
GR1GameAlg(Module env,
Module sys,
GeneralizedReactivePair gr_pair)
|
Method Summary | |
---|---|
AlgResultI |
calculate_strategy(int kind)
Extracting an implementation from the set of possible strategies with the given priority to the next step. |
AlgResultI |
doAlgorithm()
performing the GR 1 game itself, and collecting all memory. |
AlgResultI |
postAlgorithm()
The post algorithm calculate the synthesizing implementation. |
AlgResultI |
preAlgorithm()
Does nothing. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public BDD[][][] x_mem
public BDD[][] y_mem
public BDD[] z_mem
Constructor Detail |
---|
public GR1GameAlg(Module env, Module sys, GeneralizedReactivePair gr_pair) throws GameAlgException
GameAlgException
Method Detail |
---|
public AlgResultI preAlgorithm() throws GameAlgException
preAlgorithm
in interface AlgI
GameAlgException
AlgI.preAlgorithm()
public AlgResultI doAlgorithm() throws GameAlgException
doAlgorithm
in interface AlgI
GameAlgException
AlgI.doAlgorithm()
public AlgResultI postAlgorithm() throws GameAlgException
The post algorithm calculate the synthesizing implementation.
Extracting an arbitrary implementation from the set of possible strategies.
postAlgorithm
in interface AlgI
GameAlgException
public AlgResultI calculate_strategy(int kind)
Extracting an implementation from the set of possible strategies with the given priority to the next step.
Possible priorities are:
3 - Z Y X.
7 - Z X Y.
11 - Y Z X.
15 - Y X Z.
19 - X Z Y.
23 - X Y Z.
kind
- The priority kind.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |