#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2001

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Marie Duflot, Laurent Fribourg, +5 authors Claudine Picaronny
- Electr. Notes Theor. Comput. Sci.
- 2005

— Carrier Sense Multiple Access/Collision Detection (CSMA/CD) is the protocol for carrier transmission access in Ethernet networks (international standard IEEE 802.3). On Ethernet, any Network Interface Card (NIC) can try to send a packet in a channel at any time. If another NIC tries to send a packet at the same time, a collision is said to occur and the… (More)

- Paolo Ballarini, Hilal Djafri, Marie Duflot, Serge Haddad, Nihal Pekergin
- VALUETOOLS
- 2011

We introduce the Hybrid Automata Stochastic Logic (HASL), a new temporal logic formalism for the verification of discrete event stochastic processes (DESP). HASL employs Linear Hybrid Au-tomata (LHA) as machineries to select prefixes of relevant execution paths of a DESP D. The advantage with LHA is that rather elaborate information can be collected… (More)

- Myrto Arapinis, Marie Duflot
- FSTTCS
- 2007

The verification of security protocols has been proven to be undecidable in general. Different approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs, therefore bounding message length. In this paper we show how to get message… (More)

—This tool paper introduces COSMOS, a statistical model checker for the Hybrid Automata Stochastic Logic (HASL). HASL employs Linear Hybrid Automata (LHA), a generalization of Deterministic Timed Automata (DTA), to describe accepting execution paths of a Discrete Event Stochastic Process (DESP), a class of stochastic models which includes, but is not… (More)

- Marie Duflot, Laurent Fribourg, Claudine Picaronny
- Distributed Computing
- 2002

We consider Lehmann-Rabin’s randomized solution to the well-known problem of the dining philosophers. Up to now, such an analysis has always required a “fairness” assumption on the scheduling mechanism: if a philosopher is continuously hungry then he must eventually be scheduled. In contrast, we modify here the algorithm in order to get rid of the fairness… (More)

- Marie Duflot, Marta Z. Kwiatkowska, Gethin Norman, David Parker
- International Journal on Software Tools for…
- 2004

This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a complex interaction between several devices, some of which exhibit random behaviour. We use probabilistic model checking and, in particular, the tool PRISM to compute the best- and… (More)

- Marie Duflot, Laurent Fribourg, Claudine Picaronny
- DISC
- 2001

- Marie Duflot, Marta Kwiatkowska, +4 authors Jeremy Sproston
- 2009

7.1 OUTLINE Probabilistic model checking is a formal verification technique for the analysis of systems that exhibit stochastic behaviour. It has been successfully employed in an extremely wide array of application domains including, for example, communication and multimedia protocols, security and power management. In this chapter we focus on the… (More)

- Paolo Ballarini, Benoît Barbot, Marie Duflot, Serge Haddad, Nihal Pekergin
- Perform. Eval.
- 2015

We introduce the Hybrid Automata Stochastic Language (HASL), a new temporal logic formalism for the verification of Discrete Event Stochastic Processes (DESP). HASL employs a Linear Hybrid Automaton (LHA) to select prefixes of relevant execution paths of a DESP. LHA allows rather elaborate information to be collected on-the-fly during path selection,… (More)

- Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault
- CONCUR
- 2009

In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for permissivity of such strategies by assigning penalties when blocking transitions. We prove that for reachability objectives, most permissive strategies exist, can be chosen… (More)