Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems (Q547916): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: HySAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PaQuBE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MathSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABsolver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.nahs.2010.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004120748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HySAT: An efficient proof engine for bounded model checking of hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Boolean satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPSSAT: Approximate probabilistic planning using stochastic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering constraint solvers for automatic analysis of probabilistic hybrid automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3434956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank

Latest revision as of 05:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
scientific article

    Statements

    Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2011
    0 references
    concurrent probabilistic hybrid systems
    0 references
    probabilistic logic
    0 references
    constraint satisfaction problems
    0 references
    problem solvers
    0 references
    automatic verification
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers