LTL2BA
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Unbeast: Symbolic Bounded Synthesis
- A constraint-based approach to solving games on infinite graphs
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
- Model Checking Using Generalized Testing Automata
- Minimal counterexamples for linear-time probabilistic verification
- From LTL to Symbolically Represented Deterministic Automata
- Hybrid Systems: Computation and Control
- Decidability of LTL for vector addition systems with one zero-test
- Automata theory and model checking
- Model checking of pushdown systems for projection temporal logic
- Comparison of algorithms for checking emptiness on Büchi automata
- LTL to self-loop alternating automata with generic acceptance and back
- Linear Encodings of Bounded LTL Model Checking
- Model Checking Software
- An automata view to goal-directed methods
- Verifying a signature architecture: a comparative case study
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Unfoldings: A partial-order approach to model checking.
- Experiments with deterministic -automata for formulas of linear temporal logic
- scientific article; zbMATH DE number 7577580 (Why is no real title available?)
- The Linear Temporal Logic of Rewriting Maude Model Checker
- Model Checking LTL Formulae in RAISE with FDR
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- The Maude LTL model checker
- Efficient approach of translating LTL formulae into Büchi automata
- Approximate automata for omega-regular languages
- Theorem Proving in Higher Order Logics
- scientific article; zbMATH DE number 1973989 (Why is no real title available?)
- On-the-fly emptiness check of transition-based Streett automata
- Implementation and Application of Automata
- Temporal property verification as a program analysis task
- New optimizations and heuristics for determinization of Büchi automata
- GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic
- Symbolic bounded synthesis
- Computer Aided Verification
- Simulation relations for alternating Büchi automata
- On clock-aware LTL parameter synthesis of timed automata
- Applications and Theory of Petri Nets 2004
- Computer Aided Verification
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- The mu-calculus and Model Checking
- MCGP
- FoCs
- PROD
- POEM
- SPIN
- Maria
- LiQuor
- NuSMV
- CUDD
- Punf
- COMICS
- TaPAS
- SPOT
- Cadence SMV
- CESAR
- DiPro
- BEEM
- Casaal
- LTLCon
- PRALINE
- GOAL
- Antichains
- Java-MaC
- ProbReach
- ltl2dstar
- Rabinizer
- Acacia+
- LTL_to_DRA
- lbtt
- SReachTools
- EAGLE
- Copilot
- MSO_Regex_Equivalence
- Program-Conflict-Analysis
- libVATA
- TXP
- WPDS++
- Baselines
- AMYTISS
- StocHy
- ltl3tela
- Boolean_Expression_Checkers
- VIS
- scientific article; zbMATH DE number 1796123 (Why is no real title available?)
- Specification and verification of declarative open interaction models. A logic-based approach
- Linear temporal logic symbolic model checking
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
- Concepts of Automata Construction from LTL
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic
- Tools and Algorithms for the Construction and Analysis of Systems
- Büchi Store: an open repository of Büchi automata
- Incremental reasoning on monadic second-order logics with logic programming
- SeDuMi Interface
- Mathematical Foundations of Computer Science 2003
- Mediating for reduction (on minimizing alternating Büchi automata)
- Tool support for learning Büchi automata and linear temporal logic
- Mediating for reduction (on minimizing alternating Büchi automata)
This page was built for software: LTL2BA
