Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems

DOI10.1016/j.nahs.2010.04.009zbMath1225.93102OpenAlexW2004120748MaRDI QIDQ547916

Martin Fränzle, Andreas Eggers, Tino Teige

Publication date: 27 June 2011

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nahs.2010.04.009

zbMATH Keywords

constraint satisfaction problemsautomatic verificationprobabilistic logicconcurrent probabilistic hybrid systemsproblem solvers

Mathematics Subject Classification ID

Stochastic systems in control theory (general) (93E03) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (4)

Statistical Model Checking for Networks of Priced Timed Automata ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ New results on passivity-based \(\mathcal{H}_\infty\) control for networked cascade control systems with application to power plant boiler-turbine system ⋮ Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems

Uses Software

• HySAT
• PaQuBE
• MathSAT
• ABsolver

Cites Work

• Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• Games against nature
• Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
• SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
• Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
• Hybrid Systems: Computation and Control
• Verification, Model Checking, and Abstract Interpretation
• Stochastic Boolean satisfiability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems