scientific article; zbMATH DE number 438994
From MaRDI portal
Publication:3141897
Recommendations
Cited in
(only showing first 100 items - show all)- Don't care words with an application to the automata-based approach for real addition
- Automatic symmetry detection for Promela
- Proceedings of the 1st international workshop on Symbolic model checking (SMC '99), as part of the 2nd federated logic conference (FLoC '99). Trento, Italy, July 6, 1999
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- A satisfiability procedure for quantified Boolean formulae
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Formally verified algorithms for upper-bounding state space diameters
- Model checking temporal properties of reaction systems
- Syntax-directed model checking of sequential programs
- Sequential testing of complex systems: a review
- An efficient algorithm for computing bisimulation equivalence
- The temporal boolean derivative applied to verification of extended finite state machines
- Symbolic synthesis of masking fault-tolerant distributed programs
- Formal verification based on Boolean expression diagrams
- A decision procedure and complete axiomatization for projection temporal logic
- Model-based safety assessment of a triple modular generator with xSAP
- Logic for \(\omega\)-pushdown automata
- Lifted model checking for relational MDPs
- Leveraging Horn clause solving for compositional verification of PLC software
- Efficient decision procedure for propositional projection temporal logic
- Exact quantitative probabilistic model checking through rational search
- Toward model selection by formal methods
- Verification and enforcement of access control policies
- Book review of: E. M. Clarke (ed.) et al., Handbook of model checking
- Counterexample-preserving reduction for symbolic model checking
- Specification and verification of concurrent programs through refinements
- The complexity of automated addition of fault-tolerance without explicit legitimate states
- 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
- Symbolic model checking for channel-based component connectors
- Cyclic-routing of unmanned aerial vehicles
- Model checking of pushdown systems for projection temporal logic
- An automatic method for the dynamic construction of abstractions of states of a formal model
- A decision procedure for propositional projection temporal logic with infinite models
- Verifying untimed and timed aspects of the experimental batch plant
- Bounded model checking of traffic light control system
- Using heuristic search for finding deadlocks in concurrent systems
- A framework for compositional nonblocking verification of extended finite-state machines
- Modeling, analyzing and slicing periodic distributed computations
- Formal models of timing attacks on web privacy
- Specifying and verifying reactive systems in a multi-language environment
- Towards deriving test sequences by model checking
- Unfolding Grammars in Adhesive Categories
- On application of multi-rooted binary decision diagrams to probabilistic model checking
- Complete abstractions and subclassical modal logics
- Directed Model Checking for B: An Evaluation and New Techniques
- Runtime verification of component-based systems
- Introduction to model checking
- Binary decision diagrams
- Transfer of model checking to industrial practice
- Functional specification of hardware via temporal logic
- Symbolic model checking in non-Boolean domains
- Weak Second‐Order Arithmetic and Finite Automata
- Model checking learning agent systems using Promela with embedded C code and abstraction
- 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
- Abstraction for model checking multi-agent systems
- 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
- The sweep-line state space exploration method
- scientific article; zbMATH DE number 1231654 (Why is no real title available?)
- scientific article; zbMATH DE number 1324661 (Why is no real title available?)
- scientific article; zbMATH DE number 1324664 (Why is no real title available?)
- Symbolic execution of Reo circuits using constraint automata
- Kripke modelling and verification of temporal specifications of a multiple UAV system
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
- A framework for multi-robot motion planning from temporal logic specifications
- Symbolic bounded synthesis
- Symbolic model checking for probabilistic processes
- Quantifier elimination by dependency sequents
- Bounded semantics
- Rank-based symbolic bisimulation: (and model checking)
- Adequate sets of temporal connectives in CTL
- Concurrency for Graph Grammars in a Petri net shell
- Efficient CTL verification via Horn constraints solving
- Weighted automata and weighted logics
- Ordered binary decision diagrams and the Davis-Putnam procedure
- scientific article; zbMATH DE number 7250156 (Why is no real title available?)
- Maximally permissive controlled system synthesis for non-determinism and modal logic
- Weakest invariant generation for automated addition of fault-tolerance
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Proving the refuted: symbolic model checkers as proof generators
- Smaller Abstractions for ∀CTL* without Next
- Application of Wu's method to symbolic model checking
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A data-flow approach to test multi-agent ASMs
- From Monadic Logic to PSL
- Automata-Theoretic Model Checking Revisited
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141897)
