The following pages link to MONA (Q18304):
Displaying 50 items.
- (Q2771059) (← links)
- Monitoring metric first-order temporal properties (Q2796403) (← links)
- Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata (Q2814129) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Interval duration logic: expressiveness and decidability (Q2842590) (← links)
- Finding extremal models of discrete duration calculus formulae using symbolic search (Q2848425) (← links)
- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem (Q2867070) (← links)
- Decidability of a hybrid duration calculus (Q2867952) (← links)
- Expansions of MSO by cardinality relations (Q2871470) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (Q2894267) (← links)
- Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (Q2918989) (← links)
- Property Directed Reachability for Proving Absence of Concurrent Modification Errors (Q2961566) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- From Sequential Extended Regular Expressions to NFA with Symbolic Labels (Q3073625) (← links)
- Simulations of Weighted Tree Automata (Q3073652) (← links)
- An Evaluation of Automata Algorithms for String Analysis (Q3075486) (← links)
- Graph structure and monadic second-order logic. A language-theoretic approach (Q3077955) (← links)
- Combining Logic Programs and Monadic Second Order Logics by Program Transformation (Q3079918) (← links)
- A Generic Program for Minimal Subsets with Applications (Q3079925) (← links)
- Model Checking Parameterized Systems (Q3176379) (← links)
- Formalizing the Logic-Automaton Connection (Q3183526) (← links)
- Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall (Q3393383) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- Spatio-temporal Model Checking for Mobile Real-Time Systems (Q3525160) (← links)
- Decomposable structures, Boolean function representations, and optimization (Q3568997) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (Q3613378) (← links)
- PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic (Q3643268) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- (Q4218920) (← links)
- (Q4218939) (← links)
- (Q4263079) (← links)
- (Q4418627) (← links)
- (Q4427903) (← links)
- (Q4518896) (← links)
- (Q4530471) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- (Q4679533) (← links)
- (Q4737005) (← links)
- (Q4737006) (← links)
- (Q4808811) (← links)
- (Q4818808) (← links)
- (Q4904149) (← links)
- A Framework for Decentralized Physical Access Control using Finite State Automata (Q4907858) (← links)
- Regular Model Checking using Widening Techniques (Q4921501) (← links)
- Verifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol (Q4921502) (← links)
