The following pages link to Marta Kwiatkowska (Q278754):
Displaying 50 items.
- Expected reachability-time games (Q278757) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- An algebraic theory of interface automata (Q402131) (← links)
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
- Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
- (Q839946) (redirect page) (← links)
- A mass action model of a fibroblast growth factor signaling pathway and its simplification (Q839947) (← links)
- Event fairness and non-interleaving concurrency (Q911318) (← links)
- A metric for traces (Q911785) (← links)
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol (Q1402478) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- (Q1641026) (redirect page) (← links)
- Compositional strategy synthesis for stochastic games with multiple objectives (Q1641028) (← links)
- Uniform sampling for timed automata with application to language inclusion measurement (Q1693099) (← links)
- Approximation of probabilistic reachability for chemical reaction networks using the linear noise approximation (Q1693119) (← links)
- Adaptive aggregation of Markov chains: quantitative analysis of chemical reaction networks (Q1702921) (← links)
- A stochastic hybrid approximation for chemical kinetics based on the linear noise approximation (Q1706581) (← links)
- A specification theory of real-time processes (Q1708707) (← links)
- Experimental biological protocols with formal semantics (Q1796495) (← links)
- On the complexity of model checking interval-valued discrete time Markov chains (Q1943636) (← links)
- Approximate policy iteration for Markov decision processes via quantitative adaptive aggregations (Q1990495) (← links)
- DNA walker circuits: computational potential, design, and verification (Q2003463) (← links)
- Syntax-guided optimal synthesis for chemical reaction networks (Q2164238) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Precise parameter synthesis for stochastic biochemical systems (Q2407983) (← links)
- Quantitative verification of implantable cardiac pacemakers over hybrid heart models (Q2453219) (← links)
- A refinement-based process algebra for timed automata (Q2576580) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions (Q2636513) (← links)
- Domain equations for probabilistic processes (Q2709785) (← links)
- (Q2736356) (← links)
- Programming Discrete Distributions with Chemical Reaction Networks (Q2835702) (← links)
- Chemical Reaction Network Designs for Asynchronous Logic Circuits (Q2835704) (← links)
- A symbolic out-of-core solution method for Markov models (Q2842856) (← links)
- Towards a unifying CSP approach to hierarchical verification of asynchronous hardware (Q2848424) (← links)
- On Stochastic Games with Multiple Objectives (Q2849916) (← links)
- Advances in Quantitative Verification for Ubiquitous Computing (Q2851899) (← links)
- Compositional state space reduction using untangled actions (Q2866342) (← links)
- A Compositional Specification Theory for Component Behaviours (Q2892725) (← links)
- Automatic Verification of Competitive Stochastic Systems (Q2894279) (← links)
- Playing Stochastic Games Precisely (Q2912689) (← links)
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets (Q2941140) (← links)
- Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata (Q2945592) (← links)
- Cognitive Reasoning and Trust in Human-Robot Interactions (Q2988805) (← links)
- Building Power Consumption Models from Executable Timed I/O Automata Specifications (Q2988984) (← links)
- (Q2999187) (← links)
- Time-Bounded Verification of CTMCs against Real-Time Specifications (Q3172840) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Concavely-Priced Probabilistic Timed Automata (Q3184689) (← links)
