Titlebook: Reachability Problems; 10th International W Kim Guldstrand Larsen,Igor Potapov,Jiří Srba Conference proceedings 2016 Springer International

Heresy

Decidable Models of Integer-Manipulating Programs with Recursive Parallelism,at reachability becomes NP-complete. In fact, it is poly-time reducible to satisfaction over existential Presburger formulas, which allows one to tap into highly optimised SMT solvers. Our decidable approximation strictly generalises known decidable models including (i) weakly-synchronised ground-tr

parallelism

averse

无弹性

刺耳的声音

Distributed Synthesis of State-Dependent Switching Control,s method can be performed in a distributed manner. The method has been implemented and successfully applied to the synthesis of a distributed control of a concrete floor heating system with 11 rooms and . switching modes.

Gingivitis

RAG

neolith

六边形

minion

On the Complexity of Resource-Bounded Logics,extension of RBTL with arbitrary path formulae), namely .-complete, proving a new decidability result as a by-product of the approach. Finally, we establish that the model-checking problem for RB.ATL. is decidable by a reduction to parity games, and show how to synthesise values for resource parameters.