Titlebook: Reachability Problems; 7th International Wo Parosh Aziz Abdulla,Igor Potapov Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

時(shí)代錯(cuò)誤

MELD

Branching-Time Model Checking Gap-Order Constraint Systems,ments . and .. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form .???.?≥?., where . and . are variables or constants and .?∈?? is a non-negative constant. We show that . model checking is undecid

馬賽克

Constructing Minimal Coverability Sets,ng of a place can be converted to ., and the manipulation of the set . of maximal .-markings that have been found so far. For the former, a technique is presented that consumes very little time in addition to what maintaining . consumes. It is based on Tarjan’s algorithm for detecting maximal strong

essential-fats

On the Complexity of Counter Reachability Games,nd adding its label to a counter vector. The objective is to reach a given counter value in a given location. We distinguish three semantics for counter reachability games, according to what happens when a counter value would become negative: the edge is either disabled, or enabled but the counter v

顛簸地移動(dòng)

Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multipliciti restriction that each transition has at most one incoming edge. We use canonical firing sequences with nice properties for gcf-PNs to show that the RecLFS, (zero-)reachability, covering, and boundedness problems of gcf-PNs are in PSPACE. By showing, how PSPACE-Turing machines can be simulated by gs

Respond

Robustness in Timed Automata,rs such as execution times that are longer or shorter than expected..We consider the perturbation model of guard enlargement and formulate several robust verification problems that have been studied recently, including robustness analysis, robust implementation, and robust control.