Sciweavers

Share
HYBRID
2000
Springer
9 years 7 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
HYBRID
2000
Springer
9 years 7 months ago
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
Peter Niebert, Sergio Yovine
FORMATS
2006
Springer
9 years 7 months ago
Undecidable Problems About Timed Automata
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
Olivier Finkel
FORMATS
2006
Springer
9 years 7 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
FORMATS
2006
Springer
9 years 7 months ago
Model Checking Timed Automata with Priorities Using DBM Subtraction
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Alexandre David, John Håkansson, Kim Guldstr...
CAV
2006
Springer
86views Hardware» more  CAV 2006»
9 years 7 months ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
FSEN
2009
Springer
9 years 7 months ago
Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
Uli Fahrenberg, Kim G. Larsen, Claus R. Thrane
FORMATS
2007
Springer
9 years 7 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
CONCUR
2009
Springer
9 years 7 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
HYBRID
1998
Springer
9 years 7 months ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
books