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.
It seams to me that APT buffers the graph when calling getReachability and when calling getCoverability (and get() uses getCoverability?) with two different keys. This means, one should uniquely call the same method to not produce overhead (since for aus (1-bounded) the reachability and the coverabillity graphs are equal).
It seams to me that APT buffers the graph when calling getReachability and when calling getCoverability (and get() uses getCoverability?) with two different keys. This means, one should uniquely call the same method to not produce overhead (since for aus (1-bounded) the reachability and the coverabillity graphs are equal).