The following pages link to (Q3141897):
Displaying 50 items.
- A framework for compositional nonblocking verification of extended finite-state machines (Q262429) (← links)
- Model checking learning agent systems using Promela with embedded C code and abstraction (Q333329) (← links)
- Abstraction for model checking multi-agent systems (Q352029) (← links)
- The sweep-line state space exploration method (Q418783) (← links)
- Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
- Kripke modelling and verification of temporal specifications of a multiple UAV system (Q434449) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- A framework for multi-robot motion planning from temporal logic specifications (Q439866) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← links)
- Bounded semantics (Q483292) (← links)
- Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← links)
- A data-flow approach to test multi-agent ASMs (Q539229) (← links)
- A formal logic approach to constrained combinatorial testing (Q616856) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Abstract reduction in directed model checking CCS processes (Q715051) (← links)
- Analysing neurobiological models using communicating automata (Q736844) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Quantified epistemic logics for reasoning about knowledge in multi-agent systems (Q835839) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Algebraic simulations (Q844884) (← links)
- Weighted automata and weighted logics on infinite words (Q845080) (← links)
- Symmetry and partial order reduction techniques in model checking Rebeca (Q845239) (← links)
- Action language verifier: An infinite-state model checker for reactive software specifications (Q845244) (← links)
- Feature interaction detection by pairwise analysis of LTL properties -- A case study (Q853722) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic (Q896152) (← links)
- Synchronizing relations on words (Q905682) (← links)
- A functional formalization of on chip communications (Q931433) (← links)
- Automated assumption generation for compositional verification (Q934710) (← links)
- Embedding finite automata within regular expressions (Q947783) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- On the constructive orbit problem (Q976988) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Symbolic perimeter abstraction heuristics for cost-optimal planning (Q1647507) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- Model checking temporal properties of reaction systems (Q1749193) (← links)
- Syntax-directed model checking of sequential programs (Q1858441) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Symbolic synthesis of masking fault-tolerant distributed programs (Q1938357) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
