Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #101 to #150.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Improved Single Pass Algorithms for Resolution Proof Reduction: Label: en
  2. On Temporal Logic and Signal Processing: Label: en
  3. The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower Bound Constraints: Label: en
  4. Rabinizer: Small Deterministic Automata for LTL(F,G): Label: en
  5. A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations: Label: en
  6. Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata: Label: en
  7. Approximating Deterministic Lattice Automata: Label: en
  8. Dynamic Bayesian Networks: A Factored Model of Probabilistic Dynamics: Label: en
  9. State Space Reduction of Linear Processes Using Control Flow Reconstruction: Label: en
  10. Exploring the Scope for Partial Order Reduction: Label: en
  11. Local Search in Model Checking: Label: en
  12. On Detecting Regular Predicates in Distributed Systems: Label: en
  13. LTL Model Checking for Recursive Programs: Label: en
  14. Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation: Label: en
  15. Dynamic Observers for the Synthesis of Opaque Systems: Label: en
  16. Formal Verification for High-Assurance Behavioral Synthesis: Label: en
  17. Synthesis of Fault-Tolerant Distributed Systems: Label: en
  18. Logahedra: A New Weakly Relational Domain: Label: en
  19. Don’t Know for Multi-valued Systems: Label: en
  20. A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement: Label: en
  21. Incremental False Path Elimination for Static Software Analysis: Label: en
  22. Specification Languages for Stutter-Invariant Regular Properties: Label: en
  23. On Minimal Odd Rankings for Büchi Complementation: Label: en
  24. On-the-fly Emptiness Check of Transition-Based Streett Automata: Label: en
  25. Solving Parity Games in Practice: Label: en
  26. A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems: Label: en
  27. Quantitative Analysis under Fairness Constraints: Label: en
  28. Statistical Model Checking Using Perfect Simulation: Label: en
  29. LTL Model Checking of Time-Inhomogeneous Markov Chains: Label: en
  30. A Data Symmetry Reduction Technique for Temporal-epistemic Logic: Label: en
  31. Passive Testing of Timed Systems: Label: en
  32. Practical Efficient Modular Linear-Time Model-Checking: Label: en
  33. Run-Time Monitoring of Electronic Contracts: Label: en
  34. Impartial Anticipation in Runtime-Verification: Label: en
  35. Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol: Label: en
  36. Deciding Bisimilarity of Full BPA Processes Locally: Label: en
  37. Tree Pattern Rewriting Systems: Label: en
  38. Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic: Label: en
  39. Model Based Importance Analysis for Minimal Cut Sets: Label: en
  40. On the Applicability of Stochastic Petri Nets for Analysis of Multiserver Retrial Systems with Different Vacation Policies: Label: en
  41. Decidable Compositions of O-Minimal Automata: Label: en
  42. Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions: Label: en
  43. Controllable Test Cases for the Distributed Test Architecture: Label: en
  44. SMELS: Satisfiability Modulo Equality with Lazy Superposition: Label: en
  45. SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems: Label: en
  46. Interpolants for Linear Arithmetic in SMT: Label: en
  47. Automating Algebraic Specifications of Non-freely Generated Data Types: Label: en
  48. Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions: Label: en
  49. Loop Summarization Using Abstract Transformers: Label: en
  50. Model Checking Recursive Programs with Exact Predicate Abstraction: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)