Fairness and regularity for SCCS processes
Irène Guessarian, Wafâa Niar-Dinedane (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A Markovian concurrency measure”
Fairness and regularity for SCCS processes
Fast simulation for road traffic network
Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.
On continuous functions computed by finite automata
D. Derencourt, J. Karhumäki, M. Latteux, A. Terlutte (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Relationships among , , and the determinant
Eric Allender, Mitsunori Ogihara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Two-way automaton computations
Jean-Camille Birget (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Loops in automata and HDTOL relations
Karel Culik II, Juhani Karhumäki (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Some remarks on multihead automata
I. H. Sudborough (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: