The following pages link to (Q3141897):
Displayed 41 items.
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← 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 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 use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← 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)
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams (Q2372185) (← links)
- Weighted automata and weighted logics (Q2373736) (← links)
- A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic (Q2386107) (← links)
- A decision procedure for propositional projection temporal logic with infinite models (Q2480780) (← links)
- Using heuristic search for finding deadlocks in concurrent systems (Q2573636) (← links)
- Weak Second‐Order Arithmetic and Finite Automata (Q3287248) (← links)
- Model checking workflow net based on Petri net (Q3446022) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- Weighted Automata and Weighted Logics with Discounting (Q3503896) (← links)
- Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
- Model Checking Contracts – A Case Study (Q3510789) (← links)
- Symbolic Fault Tree Analysis for Reactive Systems (Q3510794) (← links)
- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space (Q3510811) (← links)
- Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction (Q3510827) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Data Flow Analysis and Testing of Abstract State Machines (Q3535367) (← links)
- Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic (Q3540082) (← links)
- McMillan’s Complete Prefix for Contextual Nets (Q3599219) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm (Q3605534) (← links)
- (Q4222979) (← links)
- (Q4255562) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (Q5458321) (← links)
- Towards Efficient Verification of Systems with Dynamic Process Creation (Q5505602) (← links)
- Minimal refinements of specifications in modal and temporal logics (Q5920375) (← links)
- On ACTL formulas having linear counterexamples (Q5943101) (← links)