Jean Mairesse

Queueing Syst. Theory Appl., 2022

2021

A product form for the general stochastic matching model.

[BibT_eX]

[DOI]

Ana Busic

J. Appl. Probab., 2021

A spectral property for concurrent systems and some probabilistic applications.

[BibT_eX]

[DOI]

Samy Abbes

Yi-Ting Chen

Discret. Math., 2021

Max-plus automata.

[BibT_eX]

[DOI]

Sylvain Lombardy

Proceedings of the Handbook of Automata Theory., 2021

2020

Editorial introduction to the special issue on stochastic matching models, matching queues and applications.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2020

2018

Reversibility and Further Properties of FCFS Infinite Bipartite Matching.

[BibT_eX]

[DOI]

Math. Oper. Res., 2018

2017

Uniform Sampling of Subshifts of Finite Type on Grids and Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

Uniform Sampling for Networks of Automata.

[BibT_eX]

[DOI]

Nicolas Basset

Michèle Soria

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Stability of the stochastic matching model.

[BibT_eX]

[DOI]

J. Appl. Probab., 2016

2015

Uniform and Bernoulli measures on the boundary of trace monoids.

[BibT_eX]

[DOI]

Samy Abbes

J. Comb. Theory, Ser. A, 2015

Uniform Generation in Trace Monoids.

[BibT_eX]

[DOI]

Samy Abbes

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Around probabilistic cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

2013

Queues with skill based parallel servers and a FCFS infinite matching model.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2013

Synthesis and Analysis of Product-form Petri Nets.

[BibT_eX]

[DOI]

Serge Haddad

Hoang-Thach Nguyen

Fundam. Informaticae, 2013

2012

Selected papers from ValueTools 2009.

[BibT_eX]

[DOI]

Giovanni Stea

Perform. Evaluation, 2012

On the Finiteness Problem for Automaton (Semi)Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2012

Probabilistic cellular automata and random fields with i.i.d. directions

[BibT_eX]

[DOI]

CoRR, 2012

Implementing Computations in Automaton (Semi)groups.

[BibT_eX]

[DOI]

Ines Klimann

Matthieu Picantin

Proceedings of the Implementation and Application of Automata, 2012

Density Classification on Infinite Lattices and Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Foreword: Special section on performance evaluation methodologies.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2011

Probabilistic cellular automata, invariant measures, and perfect sampling.

[BibT_eX]

[DOI]

Ana Busic

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

Stability of the bipartite matching model.

[BibT_eX]

[DOI]

Ana Busic

Varun Gupta

SIGMETRICS Perform. Evaluation Rev., 2010

Towards an Erlang formula for multiclass networks.

[BibT_eX]

[DOI]

Matthieu Jonckheere

Queueing Syst. Theory Appl., 2010

Deficiency Zero Petri Nets and Product Form.

[BibT_eX]

[DOI]

Hoang-Thach Nguyen

Fundam. Informaticae, 2010

A non-ergodic PCA with a unique invariant measure

[BibT_eX]

[DOI]

Philippe Chassaing

CoRR, 2010

2009

Guest Editorial.

[BibT_eX]

[DOI]

François Baccelli

Queueing Syst. Theory Appl., 2009

2008

Zero-Automatic Networks.

[BibT_eX]

[DOI]

Thu-Ha Dao-Thi

Discret. Event Dyn. Syst., 2008

Guest Editorial.

[BibT_eX]

[DOI]

Eitan Altman

Discret. Event Dyn. Syst., 2008

Minimization of circuit registers: Retiming revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton

[BibT_eX]

[DOI]

CoRR, 2007

Queues, stores, and tableaux

[BibT_eX]

[DOI]

Moez Draief

Neil O'Connell

CoRR, 2007

Products of irreducible random matrices in the (Max,+) Algebra

[BibT_eX]

[DOI]

CoRR, 2007

Zero-automatic queues and product form

[BibT_eX]

[DOI]

Thu-Ha Dao-Thi

CoRR, 2007

2006

Series which are both max-plus and min-plus rational are unambiguous.

[BibT_eX]

[DOI]

Sylvain Lombardy

RAIRO Theor. Informatics Appl., 2006

Growth Series for Artin Groups of Dihedral Type.

[BibT_eX]

[DOI]

Frédéric Mathéus

Int. J. Algebra Comput., 2006

Extremal Throughputs in Free-Choice Nets.

[BibT_eX]

[DOI]

Anne Bouillard

Discret. Event Dyn. Syst., 2006

2005

Services within a Busy Period of an M/M/1 Queue and Dyck Paths.

[BibT_eX]

[DOI]

Moez Draief

Queueing Syst. Theory Appl., 2005

Zero-Automatic Queues.

[BibT_eX]

[DOI]

Thu-Ha Dao-Thi

Proceedings of the Formal Techniques for Computer Systems and Business Processes, 2005

Throughput in stochastic free-choice nets under various policies.

[BibT_eX]

[DOI]

Anne Bouillard

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Blocking a transition in a free choice net and what it tells about its throughput.

[BibT_eX]

[DOI]

Stefan Haar

J. Comput. Syst. Sci., 2003

Computing the average parallelism in trace monoids.

[BibT_eX]

[DOI]

Daniel Krob

Ioannis Michos

Discret. Math., 2003

Joint Burke's Theorem and RSK Representation for a Queue and a Store.

[BibT_eX]

[DOI]

Moez Draief

Neil O'Connell

Proceedings of the Discrete Random Walks, 2003

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Generating Series of the Trace Group.

[BibT_eX]

[DOI]

Anne Bouillard

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Asymptotic behavior in a heap model with two pieces.

[BibT_eX]

[DOI]

Laurent Vuillon

Theor. Comput. Sci., 2002

On the Average Parallelism in Trace Monoids.

[BibT_eX]

[DOI]

Daniel Krob

Ioannis Michos

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2001

On the average Cartier-Foata height of traces.

[BibT_eX]

[DOI]

Daniel Krob

Ioannis Michos

Electron. Notes Discret. Math., 2001

2000

Computations of Uniform Recurrence Equations Using Minimal Memory Size.

[BibT_eX]

[DOI]

Alain Jean-Marie

SIAM J. Comput., 2000

Bilinear Functions and Trees over the (max, +) Semiring.

[BibT_eX]

[DOI]

Sabrina Mantaci

Vincent D. Blondel

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

Modeling and analysis of timed Petri nets using heaps of pieces.

[BibT_eX]

[DOI]

Stéphane Gaubert

IEEE Trans. Autom. Control., 1999

Asymptotic analysis of heaps of pieces and application to timed Petri nets.

[BibT_eX]

[DOI]

Stéphane Gaubert

Proceedings of the 8th International Workshop on Petri Nets and Performance Models, 1999

1995

A graphical approach of the spectral theory in the (max, +) algebra.

[BibT_eX]

[DOI]