Sciweavers

RP
2015
Springer
8 years 3 months ago
A Topological Method for Finding Invariant Sets of Continuous Systems
Abstract. A usual way to find positive invariant sets of ordinary differential equations is to restrict the search to predefined finitely generated shapes, such as linear templ...
Laurent Fribourg, Eric Goubault, Sameh Mohamed, Ma...
RP
2015
Springer
8 years 3 months ago
Integer-Complete Synthesis for Bounded Parametric Timed Automata
Abstract. Ensuring the correctness of critical real-time systems, involving concurrent behaviors and timing requirements, is crucial. Parameter synthesis aims at computing dense se...
Étienne André, Didier Lime, Olivier ...
RP
2015
Springer
8 years 3 months ago
On Boundedness Problems for Pushdown Vector Addition Systems
Abstract. We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reach...
Jérôme Leroux, Grégoire Sutre,...
RP
2015
Springer
8 years 3 months ago
Over-Approximating Terms Reachable by Context-Sensitive Rewriting
For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automaton that recognizes a superset of the descendant...
Nirina Andrianarivelo, Pierre Réty
RP
2015
Springer
8 years 3 months ago
Irregular Behaviours for Probabilistic Automata
Abstract. We consider probabilistic automata over finite words. Such an automaton defines the language consisting of the set of words accepted with probability greater than a giv...
Nathanaël Fijalkow, Michal Skrzypczak
RP
2015
Springer
8 years 3 months ago
The Ideal View on Rackoff's Coverability Technique
ander Malkis. ​Multithreaded­Cartesian Abstract Interpretation of Multithreaded  Recursive Programs is Polynomial  ● Masaya Shimakawa, Shigeki Hagihara and Nao...
Ranko Lazic, Sylvain Schmitz
RP
2015
Springer
8 years 3 months ago
Polynomial Interrupt Timed Automata
Abstract. Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parame...
Béatrice Bérard, Serge Haddad, Claud...