The following pages link to (Q5322945):
Displaying 50 items.
- A framework for compositional nonblocking verification of extended finite-state machines (Q262429) (← links)
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems (Q262437) (← links)
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Topological abstraction of higher-dimensional automata (Q278749) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Multi-agent planning under local LTL specifications and event-based synchronization (Q290878) (← links)
- Synthesizing efficient systems in probabilistic environments (Q300419) (← links)
- Progression and verification of situation calculus agents with bounded beliefs (Q310089) (← links)
- Finite abstractions with robustness margins for temporal logic-based control synthesis (Q313326) (← links)
- ASM-based formal design of an adaptivity component for a cloud system (Q315283) (← links)
- Stability analysis and stabilization of stochastic linear impulsive, switched and sampled-data systems under dwell-time constraints (Q340687) (← links)
- Formal modeling and verification for MVB (Q364392) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Abstract probabilistic automata (Q386011) (← links)
- Characterization and computation of infinite-horizon specifications over Markov processes (Q386604) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- Model checking quantum Markov chains (Q394340) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- An interface theory for service-oriented design (Q407507) (← links)
- Combined model checking for temporal, probabilistic, and real-time logics (Q407511) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- On algebra of languages representable by vertex-labeled graphs (Q418730) (← links)
- The sweep-line state space exploration method (Q418783) (← links)
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
- Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Moving in a network under random failures: a complexity analysis (Q433350) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Probabilistic model validation for uncertain nonlinear systems (Q466275) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited (Q472810) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Runtime verification of embedded real-time systems (Q479806) (← links)
- Bounded semantics (Q483292) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Architecture-based resilience evaluation for self-adaptive systems (Q488390) (← links)
- Development of global specification for dynamically adaptive software (Q488401) (← links)
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
- Applications of an expressive statistical model checking approach to the analysis of genetic circuits (Q498908) (← links)
- Confluence reduction for Markov automata (Q507382) (← links)
- Quantitative model-checking of controlled discrete-time Markov processes (Q515573) (← links)
