Sciweavers

295 search results - page 15 / 59
» Approximating the Expressive Power of Logics in Finite Model...
Sort
View
CONCUR
1999
Springer
15 years 1 months ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
APN
2006
Springer
15 years 1 months ago
A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
Serge Haddad, Lynda Mokdad, Patrice Moreaux
CSL
2006
Springer
15 years 1 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
14 years 9 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada
JCC
2010
74views more  JCC 2010»
14 years 8 months ago
A first-order system least-squares finite element method for the Poisson-Boltzmann equation
The Poisson-Boltzmann equation is an important tool in modeling solvent in biomolecular systems. In this paper, we focus on numerical approximations to the electrostatic potential...
Stephen D. Bond, Jehanzeb Hameed Chaudhry, Eric C....