Titlebook: Reachability Problems; 9th International Wo Mikolai Bojanczyk,Slawomir Lasota,Igor Potapov Conference proceedings 2015 Springer Internation

Myocarditis

Integer-Complete Synthesis for Bounded Parametric Timed Automata,t computing dense sets of valuations for the timing requirements, guaranteeing a good behavior. However, in most cases, the emptiness problem for reachability (. whether there exists at least one parameter valuation for which some state is reachable) is undecidable and, as a consequence, synthesis p

thrombus

Polynomial Interrupt Timed Automata,n presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (.ITA). We prove that reachability is decidable in 2EXPTIME on .ITA, using an adaptation of the . method for

蕨類

Irregular Behaviours for Probabilistic Automata,greater than a given threshold. We show the existence of a universally non-regular probabilistic automaton, . an automaton such that the language it defines is non-regular for every threshold. As a corollary, we obtain an alternative and very simple proof of the undecidability of determining whether

Conflagration

Reachability in Succinct One-Counter Games,ounter is incremented or decremented by a value given in binary. We show that the winner-determination problem is .-complete regardless of whether transitions are guarded by constraints on the counter or if the counter is restricted to non-negative values.

共和國

indices

殺子女者

,The Ideal View on Rackoff’s Coverability Technique,any extensions. We show how to derive the same bounds directly on the computations of the VAS instantiation of the generic backward coverability algorithm. This relies on a dual view of the algorithm using ideal decompositions of downwards-closed sets, which exhibits a key structural invariant in th

justify

Synthesis Problems for One-Counter Automata,s and counter updates are encoded in binary. This problem asks whether for a given parametric one-counter automaton and LTL formula there exist values for the parameters such that all computations from the initial configuration satisfy the formula. We show that LTL synthesis is decidable by translat

Critical

On Boundedness Problems for Pushdown Vector Addition Systems,dedness of the reachability set for this model can be refined into two decision problems that ask if infinitely many counter values or stack configurations are reachable, respectively. Counter boundedness seems to be the more intricate problem. We show decidability in exponential time for one-dimens

遺留之物