Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
type: Item
instance of: scholarly article
title: Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
zbMATH Open document ID: 1225.93102
author: Tino Teige
author: Andreas Eggers
author: Martin Fränzle
published in: Nonlinear Analysis. Hybrid Systems
publication date: 2011-06-27T00:00:00Z
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 93B03
Mathematics Subject Classification ID: 93C30
zbMATH DE Number: 5913690
zbMATH Keywords: concurrent probabilistic hybrid systems
zbMATH Keywords: probabilistic logic
zbMATH Keywords: constraint satisfaction problems
zbMATH Keywords: problem solvers
zbMATH Keywords: automatic verification
describes a project that uses: HySAT
describes a project that uses: PaQuBE
describes a project that uses: MathSAT
describes a project that uses: ABsolver
MaRDI profile type: Publication
full work available at URL: j.nahs.2010.04.009
OpenAlex ID: W2004120748
cites work: Q5457277
cites work: Verifying industrial hybrid systems with \textsc{MathSAT}
cites work: HySAT: An efficient proof engine for bounded model checking of hybrid systems
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
cites work: Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
cites work: Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
cites work: Games against nature
cites work: Stochastic Boolean satisfiability
cites work: APPSSAT: Approximate probabilistic planning using stochastic satisfiability
cites work: Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
cites work: Q2766628
cites work: Hybrid Systems: Computation and Control
cites work: Q3136505
cites work: Q4404205
cites work: Q4953390
cites work: Q3434956
cites work: Q3777424
cites work: Q5503674
cites work: Q3184605
DOI: 10.1016/J.NAHS.2010.04.009
Recommended article: Constraint-Based Approach for Analysis of Hybrid Systems
Recommended article: Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
Recommended article: Challenges in Constraint-Based Analysis of Hybrid Systems
Recommended article: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Recommended article: Bounded Verification of Reachability of Probabilistic Hybrid Systems
Recommended article: Automated verification and synthesis of stochastic hybrid systems: a survey
Recommended article: Constraints for Continuous Reachability in the Verification of Hybrid Systems
Recommended article: Hybrid Systems: Computation and Control
Recommended article: A formal mathematical framework for modeling probabilistic hybrid systems
Recommended article: Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
description: scientific article; zbMATH DE number 5913690