Publication:3141897
From MaRDI portal
zbMath0784.68004MaRDI QIDQ3141897
Publication date: 1 November 1993
concurrent systems; model checking; temporal logic; automatic verification; protocols; sequential circuit designs
68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
From Monadic Logic to PSL, Automata-Theoretic Model Checking Revisited, Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, Towards Efficient Verification of Systems with Dynamic Process Creation, Minimal refinements of specifications in modal and temporal logics, On ACTL formulas having linear counterexamples, \(\omega\)-regular languages are testable with a constant number of queries, Weak, strong, and strong cyclic planning via symbolic model checking, Feature interaction detection by pairwise analysis of LTL properties -- A case study, \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes, A functional formalization of on chip communications, Automated assumption generation for compositional verification, Embedding finite automata within regular expressions, Efficient SAT-based bounded model checking for software verification, On the use of MTBDDs for performability analysis and verification of stochastic systems., A satisfiability procedure for quantified Boolean formulae, Syntax-directed model checking of sequential programs, Sequential testing of complex systems: a review, An efficient algorithm for computing bisimulation equivalence, Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams, Weighted automata and weighted logics, A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic, A decision procedure for propositional projection temporal logic with infinite models, Using heuristic search for finding deadlocks in concurrent systems, Weak Second‐Order Arithmetic and Finite Automata, Model checking workflow net based on Petri net, Linear-Time Model Checking: Automata Theory in Practice, Weighted Automata and Weighted Logics with Discounting, Unfolding Graph Transformation Systems: Theory and Applications to Verification, Model Checking Contracts – A Case Study, Symbolic Fault Tree Analysis for Reactive Systems, Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space, Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction, The Birth of Model Checking, Data Flow Analysis and Testing of Abstract State Machines, Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic, McMillan’s Complete Prefix for Contextual Nets, From Philosophical to Industrial Logics, Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm, Unnamed Item, Unnamed Item
