Antichains

swMATH20208MaRDI QIDQ32028FDOQ32028

Author name not available (Why is that?)

Official website: http://link.springer.com/chapter/10.1007/11817963_5

Cited In (34)

• Title not available (Why is that?)
• Nested antichains for WS1S
• Domains for Higher-Order Games
• Efficient reduction of nondeterministic automata with application to language inclusion testing
• Fixpoint Guided Abstraction Refinement for Alternating Automata
• Algorithms for Kleene algebra with converse
• Symbolic automata for representing big code
• Random models for evaluating efficient Büchi universality checking
• Computing Weakest Strategies for Safety Games of Imperfect Information
• Regular separability of well-structured transition systems
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Antichains and compositional algorithms for LTL synthesis
• Verification of STM on relaxed memory models
• Random Generation of Deterministic Tree (Walking) Automata
• Advanced Ramsey-based Büchi automata inclusion testing
• Problems on finite automata and the exponential time hypothesis
• OpenFst
• MTBDD
• From non-preemptive to preemptive scheduling using synchronization synthesis
• Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
• Abstraction refinement and antichains for trace inclusion of infinite state systems
• Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
• Automata Learning: A Categorical Perspective
• Transactional Reduction of Component Compositions
• Parametric random generation of deterministic tree automata
• Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
• A verification-driven framework for iterative design of controllers
• Coinductive algorithms for Büchi automata
• Model checking transactional memories
• Fixed point guided abstraction refinement for alternating automata
• Ramsey-based inclusion checking for visibly pushdown automata
• Strategy construction for parity games with imperfect information
• Symbolic model checking in non-Boolean domains
• Lazy automata techniques for WS1S

This page was built for software: Antichains