The following pages link to Christel Baier (Q436314):
Displaying 50 items.
- (Q197411) (redirect page) (← links)
- Multi-valued model checking games (Q414899) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Synthesis of Reo circuits from scenario-based interaction specifications (Q541679) (← links)
- Logic and games on automatic structures. Playing with quantifiers and decompositions (Q555655) (← links)
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications (Q600975) (← links)
- Denotational linear time semantics and sequential composition (Q671406) (← links)
- Metric completion versus ideal completion (Q672047) (← links)
- Stochastic game logic (Q715046) (← links)
- Causality-based game solving (Q832242) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Alternating-time stream logic for multi-agent systems (Q967523) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- The connection between an event structure semantics and an operational semantics for TCSP (Q1323346) (← links)
- Denotational semantics in the cpo and metric approach (Q1346621) (← links)
- Metric semantics from partial order semantics (Q1365795) (← links)
- The connection between initial and unique solutions of domain equations in the partial order and metric approach (Q1377300) (← links)
- Trees and semantics (Q1391740) (← links)
- Reasoning about cost-utility constraints in probabilistic models (Q1675142) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Modeling role-based systems with exogenous coordination (Q2026788) (← links)
- The 10,000 facets of MDP model checking (Q2075778) (← links)
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- Probabilistic causes in Markov chains (Q2147196) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- On the probabilistic bisimulation spectrum with silent moves (Q2182668) (← links)
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
- Partial and conditional expectations in Markov decision processes with integer weights (Q2289095) (← links)
- Compositional construction of most general controllers (Q2350495) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Symbolic model checking for channel-based component connectors (Q2389338) (← links)
- Modeling component connectors in Reo by constraint automata (Q2495551) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- Domain equations for probabilistic processes (Q2709785) (← links)
- (Q2754096) (← links)
- (Q2754196) (← links)
- Model checking for performability (Q2843861) (← links)
- Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata (Q2849998) (← links)
- Symbolic reasoning with weighted and normalized decision diagrams (Q2852040) (← links)
- Cost and complexity of harnessing games with payments (Q2907961) (← links)
- Recurrence and transience for probabilistic automata (Q2920147) (← links)
- Stochastic Timed Automata (Q2938760) (← links)
- Quantitative Analysis of Communication Scenarios (Q2945583) (← links)
- Ratio and Weight Quantiles (Q2946351) (← links)
- Rare-event verification for stochastic hybrid systems (Q2986769) (← links)
- (Q3086919) (← links)
