Sciweavers

1728 search results - page 136 / 346
» The Size of Power Automata
Sort
View
COLING
1992
15 years 7 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
ENTCS
2006
145views more  ENTCS 2006»
15 years 6 months ago
A Classification of Time and/or Probability Dependent Security Properties
In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studnformation ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
TSE
2010
120views more  TSE 2010»
15 years 5 months ago
Time and Probability-Based Information Flow Analysis
Abstract—In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial stud...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
CODES
2010
IEEE
15 years 4 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
SPAA
2010
ACM
15 years 11 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc