Titlebook: Reachability Problems; 8th International Wo Jo?l Ouaknine,Igor Potapov,James Worrell Conference proceedings 2014 Springer International Pub

指派

On the Expressiveness of Metric Temporal Logic over Bounded Timed Words,ise semantics over bounded time domains (i.e., timed words of bounded duration) [15]. In this paper, we present an extension of . which has the same expressive power as (.[<, +1]) in both the pointwise and continuous semantics over bounded time domains.

OWL

Trace Inclusion for One-Counter Nets Revisited,ural subclass of both One-Counter Automata, which allow zero-tests and Petri Nets/VASS, which allow multiple such weak counters. The trace inclusion problem has recently been shown to be undecidable for OCN. In this paper, we contrast the complexity of two natural restrictions which imply decidabili

踉蹌

Mean-Payoff Games with Partial-Observation,paper we investigate the algorithmic properties of several subclasses of mean-payoff games where the players have asymmetric information about the state of the game. These games are in general undecidable and not determined according to the classical definition. We show that such games are determine

Ondines-curse

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions,some set of states is either maximised or minimised. Our first algorithm, based on forward exploration of the symbolic states, can only guarantee parameter values that correspond to upper (resp. lower) bounds on maximum (resp. minimum) reachability probability. To ensure precise reachability probabi

labyrinth

Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems,riants as well as discovery of meaningful predicates in CEGAR loops based on predicate abstraction. Extending such algorithms from the qualitative to the quantitative setting of probabilistic models seems desirable. In 2012, Teige et al. [1] succeeded to define an adequate notion of generalized, sto

典型

共同時代

盡管

Motilin

Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic,anguage and with guards on transitions made of simple linear constraints. This complements our understanding of model-checking flat counter systems with linear-time temporal logics, such as LTL for which the problem is already known to be (only) NP-complete with guards restricted to the linear fragment.

暫時過來

0302-9743 invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.978-3-319-11438-5978-3-319-11439-2Series ISSN 0302-9743 Series E-ISSN 1611-3349