The Experts below are selected from a list of 3120 Experts worldwide ranked by ideXlab platform
Jeanfrancois Raskin - One of the best experts on this subject based on the ideXlab platform.
-
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
Acta Informatica, 2017Co-Authors: Aaron Bohy, Jeanfrancois Raskin, Véronique Bruyère, Nathalie BertrandAbstract:When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in the quantitative setting of expected mean-payoff. This algorithm, based on the strategy iteration algorithm of Howard and Veinott, efficiently combines symbolic and explicit data structures, and uses binary decision diagrams as symbolic representation. The aim of this paper is to show that the new data structure of pseudo-Antichains (an extension of Antichains) provides another interesting alternative, especially for the class of monotonic MDPs. We design efficient pseudo-Antichain based symblicit algorithms (with open source implementations) for two quantitative settings: the expected mean-payoff and the stochastic shortest path. For two practical applications coming from automated planning and $$\mathsf {LTL}$$ LTL synthesis, we report promising experimental results w.r.t. both the run time and the memory consumption. We also show that a variant of pseudo-Antichains allows to handle the infinite state spaces underlying the qualitative verification of probabilistic lossy channel systems.
-
Antichain based qbf solving
Automated Technology for Verification and Analysis, 2011Co-Authors: Thomas Brihaye, Véronique Bruyère, Lauren Doyen, Marc Ducobu, Jeanfrancois RaskinAbstract:We consider the problem of QBF solving viewed as a reachability problem in an exponential And-Or graph. Antichain-based algorithms for reachability analysis in large graphs exploit certain subsumption relations to leverage the inherent structure of the explored graph in order to reduce the effect of state explosion, with high performance in practice. In this paper, we propose simple notions of subsumption induced by the structural properties of the And-Or graphs for QBF solving. Subsumption is used to reduce the size of the search tree, and to define compact representations of certificates (in the form of Antichains) both for positive and negative instances of QBF. We show that efficient exploration of the reduced search tree essentially relies on solving variants of Max-SAT and Min-SAT. Preliminary stand-alone experiments of this algorithm show that the Antichain-based approach is promising.
-
ATVA - Antichain-based QBF solving
Automated Technology for Verification and Analysis, 2011Co-Authors: Thomas Brihaye, Véronique Bruyère, Lauren Doyen, Marc Ducobu, Jeanfrancois RaskinAbstract:We consider the problem of QBF solving viewed as a reachability problem in an exponential And-Or graph. Antichain-based algorithms for reachability analysis in large graphs exploit certain subsumption relations to leverage the inherent structure of the explored graph in order to reduce the effect of state explosion, with high performance in practice. In this paper, we propose simple notions of subsumption induced by the structural properties of the And-Or graphs for QBF solving. Subsumption is used to reduce the size of the search tree, and to define compact representations of certificates (in the form of Antichains) both for positive and negative instances of QBF. We show that efficient exploration of the reduced search tree essentially relies on solving variants of Max-SAT and Min-SAT. Preliminary stand-alone experiments of this algorithm show that the Antichain-based approach is promising.
-
Antichain algorithms for finite automata
Tools and Algorithms for Construction and Analysis of Systems, 2010Co-Authors: Laurent Doyen, Jeanfrancois RaskinAbstract:We present a general theory that exploits simulation relations on transition systems to obtain Antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the Antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better Antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words.
-
TACAS - Antichain algorithms for finite automata
Tools and Algorithms for the Construction and Analysis of Systems, 2010Co-Authors: Laurent Doyen, Jeanfrancois RaskinAbstract:We present a general theory that exploits simulation relations on transition systems to obtain Antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the Antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better Antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words.
Dmitri I. Panyushev - One of the best experts on this subject based on the ideXlab platform.
-
Short Antichains in root systems, semi-Catalan arrangements, and B -stable subspaces
European Journal of Combinatorics, 2004Co-Authors: Dmitri I. PanyushevAbstract:Let G be a complex simple algebraic group with Lie algebra g. Fix a Borel subalgebra b. An ideal of b is called ad-nilpotent, if it is contained in [b, b]. The goal of this paper is to present a refinement of the enumerative theory of ad-nilpotent ideals in the case, where g has roots of different length. Let Ad denote the set of all ad-nilpotent ideals of b. Any c ∈ Ad is completely determined by the corresponding set of roots. The minimal roots in this set are called the generators of an ideal. The collection of generators of an ideal forms an Antichain in the poset of positive roots, and the whole theory can be expressed in the combinatorial language, in terms of Antichains. An Antichain is called strictly positive, if it contains no simple roots. Enumerative results for all and strictly positive Antichains were recently obtained in the work of Athanasiadis, Cellini–Papi, Sommers, and this author [1–4, 9, 13]. There are two different theoretical approaches to describing (enumerating) Antichains. The first approach consists of constructing a bijection between Antichains and the coroot lattice points lying in a certain simplex. An important intermediate step here is a bijection between Antichains and the so-called minimal elements of the affine Weyl group, Ŵ . It turns out that the simplex obtained is “equivalent” to a dilation of the fundamental alcove of Ŵ , so that the problem of counting the coroot lattice points in it can be resolved. For strictly positive Antichains, one constructs another bijection and another simplex, and the respective elements of Ŵ are called maximal; yet, everything is quite similar. The second approach uses the Shi bijection between the ad-nilpotent ideals (or Antichains) and the dominant regions of the Catalan arrangement. Under this bijection, the strictly positive Antichains correspond to the bounded regions. There is a powerful result of Zaslavsky allowing one to compute the number of all and bounded regions, if the characteristic polynomial of the arrangement is known. Since the characteristic polynomial of the Catalan arrangement was recently computed in [1], the result follows. If g has roots of different length, one can distinguish the length of elements occurring in Antichains. We say that an Antichain is short, if it consists of only short roots. This notion has a natural representation-theoretic incarnation: the short Antichains are in
-
Short Antichains in root systems, semi-Catalan arrangements, and B-stable subspaces
arXiv: Combinatorics, 2003Co-Authors: Dmitri I. PanyushevAbstract:Let $\be$ be a Borel subalgebra of a complex simple Lie algebra $\g$. An ideal of $\be$ is called ad-nilpotent, if it is contained in $[\be,\be]$. The generators of an ad-nilpotent ideal give rise to an Antichain in the poset of positive roots, and the whole theory can be expressed in a combinatorial fashion, in terms of Antichains. The aim of this paper is to present a refinement of the enumerative theory of ad-nilpotent ideals for the case in which $\g$ has roots of different length. An Antichain is called short, if it consists of short roots. We obtain, for short Antichains, analogues of all results known for the usual Antichains.
Elizabeth Wilcox - One of the best experts on this subject based on the ideXlab platform.
-
quasi Antichain chermak delgado lattices of finite groups
Archiv der Mathematik, 2014Co-Authors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak–Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasi-Antichain interval in the Chermak–Delgado lattice, ultimately proving that if there is a quasi-Antichain interval between subgroups L and H with L ≤ H then there exists a prime p such that H/L is an elementary abelian p-group and the number of atoms in the quasi-Antichain is one more than a power of p. In the case where the Chermak–Delgado lattice of the entire group is a quasi-Antichain, the relationship between the number of abelian atoms and the prime p is examined; additionally, several examples of groups with a quasi-Antichain Chermak–Delgado lattice are constructed.
-
Quasi-Antichain Chermak–Delgado lattices of finite groups
Archiv der Mathematik, 2014Co-Authors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak–Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasi-Antichain interval in the Chermak–Delgado lattice, ultimately proving that if there is a quasi-Antichain interval between subgroups L and H with L ≤ H then there exists a prime p such that H / L is an elementary abelian p -group and the number of atoms in the quasi-Antichain is one more than a power of p . In the case where the Chermak–Delgado lattice of the entire group is a quasi-Antichain, the relationship between the number of abelian atoms and the prime p is examined; additionally, several examples of groups with a quasi-Antichain Chermak–Delgado lattice are constructed.
-
Quasi-Antichain Chermak-Delgado Lattices of Finite Groups
arXiv: Group Theory, 2014Co-Authors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak-Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasi-Antichain interval in the Chermak-Delgado lattice, ultimately proving that if there is a quasi-Antichain interval between $L$ and $H$ with $L \leq H$ then there exists a prime $p$ such that the quotient $H / L$ is an elementary abelian $p$-group and the number of atoms in the quasi-Antichain is one more than a power of $p$. In the case where the Chermak-Delgado lattice of the entire group is a quasi-Antichain, the relationship between the number of abelian atoms and the prime $p$ is examined; additionally several examples of group with a quasi-Antichain Chermak-Delgado lattice are constructed.
Laurent Doyen - One of the best experts on this subject based on the ideXlab platform.
-
Antichain algorithms for finite automata
Tools and Algorithms for Construction and Analysis of Systems, 2010Co-Authors: Laurent Doyen, Jeanfrancois RaskinAbstract:We present a general theory that exploits simulation relations on transition systems to obtain Antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the Antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better Antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words.
-
Strategy construction for parity games with imperfect information
Information and Computation, 2010Co-Authors: Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Martin De Wulf, Thomas A. HenzingerAbstract:We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of Antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the Antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the Antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm; to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs.
-
TACAS - Antichain algorithms for finite automata
Tools and Algorithms for the Construction and Analysis of Systems, 2010Co-Authors: Laurent Doyen, Jeanfrancois RaskinAbstract:We present a general theory that exploits simulation relations on transition systems to obtain Antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the Antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better Antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words.
-
CONCUR - Strategy Construction for Parity Games with Imperfect Information
CONCUR 2008 - Concurrency Theory, 2008Co-Authors: Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram RajeAbstract:We consider imperfect-informationparity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e.to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-informationgame. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of Antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the Antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. We have implemented this algorithm as a prototype. To our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs.
-
Antichains a new algorithm for checking universality of finite automata
Lecture Notes in Computer Science, 2006Co-Authors: Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jeanfrancois RaskinAbstract:We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of Antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the Antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the Antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata.
Ben Brewster - One of the best experts on this subject based on the ideXlab platform.
-
quasi Antichain chermak delgado lattices of finite groups
Archiv der Mathematik, 2014Co-Authors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak–Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasi-Antichain interval in the Chermak–Delgado lattice, ultimately proving that if there is a quasi-Antichain interval between subgroups L and H with L ≤ H then there exists a prime p such that H/L is an elementary abelian p-group and the number of atoms in the quasi-Antichain is one more than a power of p. In the case where the Chermak–Delgado lattice of the entire group is a quasi-Antichain, the relationship between the number of abelian atoms and the prime p is examined; additionally, several examples of groups with a quasi-Antichain Chermak–Delgado lattice are constructed.
-
Quasi-Antichain Chermak–Delgado lattices of finite groups
Archiv der Mathematik, 2014Co-Authors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak–Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasi-Antichain interval in the Chermak–Delgado lattice, ultimately proving that if there is a quasi-Antichain interval between subgroups L and H with L ≤ H then there exists a prime p such that H / L is an elementary abelian p -group and the number of atoms in the quasi-Antichain is one more than a power of p . In the case where the Chermak–Delgado lattice of the entire group is a quasi-Antichain, the relationship between the number of abelian atoms and the prime p is examined; additionally, several examples of groups with a quasi-Antichain Chermak–Delgado lattice are constructed.
-
Quasi-Antichain Chermak-Delgado Lattices of Finite Groups
arXiv: Group Theory, 2014Co-Authors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak-Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasi-Antichain interval in the Chermak-Delgado lattice, ultimately proving that if there is a quasi-Antichain interval between $L$ and $H$ with $L \leq H$ then there exists a prime $p$ such that the quotient $H / L$ is an elementary abelian $p$-group and the number of atoms in the quasi-Antichain is one more than a power of $p$. In the case where the Chermak-Delgado lattice of the entire group is a quasi-Antichain, the relationship between the number of abelian atoms and the prime $p$ is examined; additionally several examples of group with a quasi-Antichain Chermak-Delgado lattice are constructed.
