Parallélisation sémantique
Permissive strategies : from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem of finding...
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...
Probabilistic evaluation of fuzzy quantified sentences: independence profile.
This paper describes a classification for fuzzy quantifiers that makes it possible to include a significant number of cases of interest (exception, comparatives). All quantifiers therein described can be evaluated by following a fuzzy model with probabilistic interpretation, based on the Theory of Generalized Quantifiers.
Program flow analysis for reducing and estimating the cost of test coverage criteria. (Abstract).
Proposal for a natural formalization of functional programming concepts