Sciweavers

534 search results - page 75 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
QEST
2008
IEEE
14 years 3 months ago
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
Pritam Roy, David Parker, Gethin Norman, Luca de A...
FOSSACS
2005
Springer
14 years 2 months ago
Fault Diagnosis Using Timed Automata
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza
PLILP
1993
Springer
14 years 27 days ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
CDC
2008
IEEE
142views Control Systems» more  CDC 2008»
13 years 10 months ago
Stability analysis of linear hyperbolic systems with switching parameters and boundary conditions
Abstract— We study asymptotic stability of an infinite dimensional system that switches between a finite set of modes. Each mode is governed by a system of one-dimensional, lin...
Saurabh Amin, Falk M. Hante, Alexandre M. Bayen
ICFEM
2009
Springer
14 years 3 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He