Suprieure Cachan's scientific contributions

Publications (17)

Article
this paper was presented at the 11th Annual Conference of the European Association for Computer Science Logic (CSL'02), Edinburgh, Scotland, 22--25 September 2002 (GoubaultLarrecq et al., 2002)
Article
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automatatheoretic technique to show pspace decidability of the logic for the constraint systems (Z; <; =) and (N ; <; =). Along the way, we give an automatatheoretic proof of a result of [BC02] when the constraint system D...
Conference Paper
We study two-way tree automata modulo equational theories. We deal with the theories of Abelian groups (ACUM ), idempotent commutative monoids (ACUI), and the theory of exclusive-or (ACUX), as well as some variants including the theory of commutative monoids (ACU ). We show that the one-way automata for all these theories are closed under union and...
Article
We study the problem of closure under complementation of languages accepted by equational tree automata. We deal with the theories of commutative monoids (ACU ), idempotent commutative monoids (ACUI), Abelian groups (ACUM ), and the theories of exclusive-or (ACUX), generalized exclusive-or (ACUXn ), and distributive minus symbol (ACUD). While the o...
Article
Continuous valuations have been proposed by several authors as a way of modeling probabilistic non-determinism in programming language semantics. Let (X; O) be a topological space. A quasi-simple valuation on X is the sup of a directed family of simple valuations. We show that quasisimple valuations are exactly those valuations that extend to conti...
Article
Lossy channel systems (LCS's) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these systems, where losses of messages are seen as faults occurring with some given probability, and where the internal behavior of the system remains nondeterministic, giving rise to...
Article
We describe a construction of coequalizers in the category Cpo Cpo Cpo of complete partial orders and continuous maps, showing that this category is cocomplete. This is not new: Meseguer proved it in 1977, using fairly abstract category-theoretic tools, and Fiech reproved it in 1996, using fairly intricate by-hand constructions. We hope to give a c...
Article
SKIn and SKInT are first-order rewrite systems, i.e., calculi of explicit substitutions in a broad sense, that implement -reduction in the -calculus and are confluent even on open terms. SKInT additionally preserves strong and weak normalization, as well as existence of head normal forms. However it implements call-by-value more naturally than call...
Article
Resolution and many refinements thereof have now been known for a long time. Completeness is usually proved by semantic means (e.g., semantic trees, Bachmair-Ganzinger forcing), or by syntactic tricks (Bledsoe's excess literal technique). The purpose of this paper is to note that there is a completely proof-theoretic way of proving completeness for...
Article
Full-text available
The article studies technological competition between open-source and proprietary software using a model from interaction theory. We argue that the organizational structure of open-source software, allowed by openness of source codes and by the subsequent development of dedicated communities, is a key feature which, together with compatibility, can...
Article
We introduce a natural notion of automata, pushdown systems, and set constraints in increasing order of expressiveness, on simply-typed -terms.
Article
Motivated by a case-study on communication protocols [BF99], the notion of updatable timed automata, a syntactic extension of the well-known timed automata de ned by Alur and Dill [AD90, AD94], has been recently studied [BDFP00a, BDFP00b]. We propose in this paper a new algorithm to test for emptiness of these updatable timed automata. This algorit...
Article
We show that ECTL+, the classical extension of CTL with fairness properties, is expressively equivalent to BTL2. BTL2 is the branching time logic with abritrary quantification over paths, and where path formulas are restricted to quantifier depth first-order formulas in the monadic logic of order. This result provides a natural yardstick by which t...
Conference Paper
Full-text available
In classical timed automata, as defined by Alur and Dill [AD90,AD94] and since widely studied, the only operation allowed to modify the clocks is the reset operation. For instance, a clock can neither be set to a non-null constant value, nor be set to the value of another clock nor, in a non-deterministic way, to some value lower or higher than a g...
Article
. We consider observational specifications of state-based systems which incorporate the declaration of a distinguished set of observer operations. These observers determine an indistinguishability relation for states which is called "observational equality". An important requirement for the non-observer operations is the compatibility with the obse...
Article
Full-text available
Transition systems defined from recursive functions IN p ! IN p are introduced and named WSN, or well-structured nets. Such "minimally Petri net-like" transition systems sit conveniently between Petri net extensions and general transition systems. In a first part, we study decidability properties of WSN classes obtained by imposing natural restrict...
Article
Full-text available
Our work intends to verify reactive systems with event memorization specied with the reactive language Electre. For this, we dene a particular behavioral model for Electre programs, Reactive Fiffo Automata (RFAs), which is close to Fifo Automata. Intuitively, a RFA is the model of a reactive system which may store event occurrences that must not be...

Citations

... Updatable timed automata(UTAs)[13,14]are extensions of timed automata, based on the possibility to update the clocks in a elaborate way such as increment and decrement operations and assignments to arbitrary values. However, generally, the reachability problem of updatable timed automata is undecidable. ...
... Valuations satisfy the modularity property ν(U 1 )+ ν(U 2 ) = ν(U 1 ∪ U 2 )+ ν(U 1 ∩ U 2 ), and (monotonic) continuity ν(U ∞ ) = lim n→∞ ν(U n ) whenever U n is an increasing sequence of open sets with U ∞ = n∈N U n . Relationships between valuations and Borel measures were given in [Eda95a] and extended in [AM02] and [GL05]. ...
... Some scholars study the competition between proprietary software and its open source alternatives. Dalle and Jullien (2002) examine the technological competition between proprietary and open source software by an interaction theory model; Meng and Lee (2005) investigate the compatibility between open source software and its proprietary substitute; Lin (2008) analyzes the impact of users' expertise on the market in which proprietary software competes with open source software; Pradniwat (2008) and Gramstad (2014) study the competition between a commercial software and a free-of-charge open source substitute in the emergence of piracy; Xing (2010) considers the quantity competition between open source and proprietary software providers; Cheng, Liu and Tang (2011) examine how the network externalities affect the competition between proprietary and open source software; Xing (2013 Xing ( , 2014a) investigates the price competition between commercial open source and proprietary software; Zeroukhi and Pénard (2014) study whether public subsidies for open source software are socially desirable and how the extent of compatibility between open source software and proprietary software influences the optimal subsidy offered. However, they do not consider the impact of open source software on the quality of proprietary software. ...
... As we do here, Goubault-Larrecq [27] proves completeness of several refinements of resolution, including hyperresolution and semantic resolution, using syntactic transformations instead of relying on the construction of a model. Chaudhuri, Pfenning, and Price [16] show that hyperresolution for Horn clauses can be explained as an instance of a sequent calculus for intuitionistic linear logic with focusing where atomic formulas are given a negative polarity. ...
... Checking existence of forced zero-sequences amounts to checking existence of infinite behaviors containing only transitions in T 0 . This can be decided by building a finite reachability tree (as defined for instance in [31,33]) for U ntime(P rune(N )). Indeed, if the reachability tree of U ntime(P rune(N )) shows existence of an infinite sequence (t 1 · · · t k ) ω with t 1 , . . . ...
... Let us recall that verification of safety properties can be reduced to reachability of a given state from a set of initial states. For some particular models like lossy channel systems [AJ96], [AAB99] automata with stacks [FWW97], [BEM97], reactive FIFO automata [SFRC99], flat counters automata ( [CJ98] and reset/transfer 2-counters automata [FS00b], [FS00a], it is possible to test reachability from a regular set of initial states because the reachability set (or the set of all predecessors) is regular and is effectively computable. But, these "decidable" models are often too restricted because we may wish to use counters with no constraints on guards and actions, as for example, broadcast protocols with parameterized initial set of states [EN98], [EFM99], [Del00]. ...
... Other interesting questions concerning Γ-behavioral equivalence may arise, such as the study of the compatibility of some operation symbols outside of Γ with respect to Γ-behavioral equivalence. This problem has been studied by Diaconescu and Futatsugui [19] and Bidoit and Hennicker [5]. ...
... and to compute the image by Approx β of each such sub-zone of Z. Note that an idea of splitting zones was already presented in [Bou00,Ben02], but it was a bit different, and, here, it appears as some kind of "necessary" condition for having a correct algorithm. ...