#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1997

2015

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alain Finkel, Pierre McKenzie, Claudine Picaronny
- Inf. Comput.
- 2004

- 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)

- Laurent Fribourg, Stéphane Messika, Claudine Picaronny
- Distributed Computing
- 2004

A randomized self-stabilizing algorithm $${\cal A}$$ is an algorithm that, whatever the initial configuration is, reaches a set $${\cal L}$$ of М legal configurations} in finite time with probability 1. The proof of convergence towards $${\cal L}$$ is generally done by exhibiting a potential function $$\varphi$$ , which measures the “vertical” distance of… (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)

- Béatrice Bérard, Claudine Picaronny
- Acta Informatica
- 2000

Timed models were introduced to describe the behaviors of real-time systems and they were usually required to produce only executions with divergent sequences of times. However, when some physical phenomena are represented by convergent executions, Zeno words appear in a natural way. Moreover, time can progress if such an infinite execution can be followed… (More)

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

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

LACL, Université Paris Est Créteil, 61 av. du Général de Gaulle, 94010 Créteil, France Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK Department of Computing Science, Sir Alwyn Williams Building, 18 Lilybank Gardens, University of Glasgow, Glasgow, G12 8RZ, UK LRI, INRIA Université Paris-Sud XI, Bâtiment 490 91405… (More)

- Benoît Barbot, Serge Haddad, Claudine Picaronny
- TACAS
- 2012

Statistical model-checking is an alternative verification technique applied on stochastic systems whose size is beyond numerical analysis ability. Given a model (most often a Markov chain) and a formula, it provides a confidence interval for the probability that the model satisfies the formula. One of the main limitations of the statistical approach is the… (More)

We consider a variant of probabilistic timed automata called parametric determinate probabilistic timed automata. Such automata are fully probabilistic: there is a single distribution of outgoing transitions from each of the automaton’s nodes, and it is possible to remain at a node only for a given amount of time. The residence time within a node may be… (More)

- Béatrice Bérard, Claudine Picaronny
- MFCS
- 1997