Antichains
From MaRDI portal
Software:32028
No author found.
Related Items (33)
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ Algorithms for Kleene algebra with converse ⋮ Symbolic automata for representing big code ⋮ Model checking transactional memories ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Problems on finite automata and the exponential time hypothesis ⋮ Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ Verification of STM on relaxed memory models ⋮ Strategy construction for parity games with imperfect information ⋮ Fixed point guided abstraction refinement for alternating automata ⋮ Parametric random generation of deterministic tree automata ⋮ From non-preemptive to preemptive scheduling using synchronization synthesis ⋮ Nested antichains for WS1S ⋮ Lazy Automata Techniques for WS1S ⋮ Coinductive Algorithms for Büchi Automata ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm ⋮ Automata Learning: A Categorical Perspective ⋮ Antichains: A New Algorithm for Checking Universality of Finite Automata ⋮ Transactional Reduction of Component Compositions ⋮ Computing Weakest Strategies for Safety Games of Imperfect Information ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems ⋮ Advanced Ramsey-Based Büchi Automata Inclusion Testing ⋮ Random Generation of Deterministic Tree (Walking) Automata ⋮ Fixpoint Guided Abstraction Refinement for Alternating Automata ⋮ Random Models for Evaluating Efficient Büchi Universality Checking ⋮ Domains for Higher-Order Games ⋮ Unnamed Item ⋮ A verification-driven framework for iterative design of controllers
This page was built for software: Antichains
