The following pages link to (Q5322945):
Displaying 50 items.
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409) (← links)
- Dynamic Bayesian networks for formal verification of structured stochastic processes (Q523135) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Computation tree logic model checking based on possibility measures (Q529055) (← links)
- Model checking fuzzy computation tree logic (Q529056) (← links)
- A temporal logic for micro- and macro-step-based real-time systems: foundations and applications (Q530560) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- Scalable offline monitoring of temporal specifications (Q681469) (← links)
- Organising LTL monitors over distributed systems with a global clock (Q681471) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- Model-based testing of probabilistic systems (Q682363) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- Stochastic game logic (Q715046) (← links)
- Optimising the ProB model checker for B using partial order reduction (Q736463) (← links)
- A formal semantics of extended hierarchical state transition matrices using CSP\# (Q736828) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- Formal reliability and failure analysis of Ethernet based communication networks in a smart grid substation (Q782499) (← links)
- Subject-oriented spatial logic (Q821569) (← links)
- Measuring the constrained reachability in quantum Markov chains (Q824285) (← links)
- Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability (Q832033) (← links)
- Formal abstraction and synthesis of parametric stochastic processes (Q832046) (← links)
- Tweaking the odds in probabilistic timed automata (Q832050) (← links)
- Adapting behaviors via reactive synthesis (Q832238) (← links)
- Runtime monitors for Markov decision processes (Q832291) (← links)
- Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
- Enforcing almost-sure reachability in POMDPs (Q832296) (← links)
- The ins and outs of first-order runtime verification (Q888417) (← links)
- Temporal logic model predictive control (Q889006) (← links)
- On the semantics of strategy logic (Q894440) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- An SMT-based approach to satisfiability checking of MITL (Q897649) (← links)
- Model checking the observational determinism security property using PROMELA and SPIN (Q903490) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Developing topology discovery in Event-B (Q1044181) (← links)
- An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
- Formal analysis of the kinematic Jacobian in screw theory (Q1624599) (← links)
- Reachability analysis of quantum Markov decision processes (Q1627964) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
