Sciweavers

303 search results - page 53 / 61
» Automata on Gauss Words
Sort
View
91
Voted
COMCOM
2000
82views more  COMCOM 2000»
15 years 6 days ago
Experience with RT-LOTOS, a temporal extension of the LOTOS formal description technique
This paper is devoted to the presentation of the RT-LOTOS formal description technique, which is a formalism suited for applications where concurrency, complex synchronization pat...
Jean-Pierre Courtiat, C. A. S. Santos, Christophe ...
94
Voted
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
15 years 5 days ago
Some Grammatical Structures of Programming Languages as Simple Bracketed Languages
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
Boris Melnikov, Elena Kashlakova
ENTCS
2002
139views more  ENTCS 2002»
15 years 5 days ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
86
Voted
JGS
2002
91views more  JGS 2002»
15 years 1 days ago
Toward micro-scale spatial modeling of gentrification
A simple preliminary model of gentrification is presented. The model is based on an irregular cellular automaton architecture drawing on the concept of proximal space, which is wel...
David O'Sullivan
TCS
2008
14 years 12 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta