search

adamtool / webinterface

The web interface for the tool Adam (AdamMC and AdamSYNT) providing an intuitive, visual definition of Petri nets with transits and Petri games, and an interactive interface to the algorithms of AdamMC and AdamSYNT. Contains the repos (as submodules): libs, framework, logics, modelchecking, examples, synthesizer, high-level, webinterface-backend.
http://adam.informatik.uni-oldenburg.de:4567/
GNU General Public License v3.0
5 stars 2 forks source link

SYNT: Alternative explicit method for calculating the two-player game incrementally #61

Closed mgieseking closed 4 years ago

mgieseking commented 4 years ago

For calculating the two-player game incrementally currently the BDD approach is used which still not finishes for larger examples in a reasonable amount of time. Add an alternative to this method and explicitly calculate the successors such that it would finish no matter how large the two-player game is.

annyanich commented 4 years ago

"Calculate for recurrently interfering player" vs. "Calculate complete" buttons inside the Graph Viewer component. When one is clicked, the BDDGraphExplorerStepwise is instantiated with the appropriate flag set.

@mgieseking Write me here once you know what methods that flag goes in :)

mgieseking commented 4 years ago

@mgieseking Write me here once you know what methods that flag goes in :)

@annyanich here it is. You can set the flag in line 235 of JobType.java:

                    BDDGraphExplorerStepwise bddGraphExplorerStepwise
                            = new BDDGraphExplorerStepwise(petriGame, false); //TODO add the correct flag here depending on the approach

But I'll put it in an extra issue since this one was for the back end.

mgieseking commented 4 years ago

Finished it in commit 9031393