Sciweavers

Share
TCS
2010
9 years 5 months ago
A comparison of semantic models for noninterference
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
Ron van der Meyden, Chenyi Zhang
TCS
2010
9 years 5 months ago
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
TCS
2010
9 years 5 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
TCS
2010
9 years 5 months ago
Monad transformers as monoid transformers
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...
Mauro Jaskelioff, Eugenio Moggi
TCS
2010
9 years 5 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
TCS
2010
9 years 5 months ago
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule
We propose a modification of the widely known Benjamin-Johnson-Hui (BJH) cellular automaton model for single-lane traffic simulation. In particular, our model includes a `slow-to-...
Adam Clarridge, Kai Salomaa
TCS
2010
9 years 5 months ago
A compact fixpoint semantics for term rewriting systems
María Alpuente, Marco Comini, Santiago Esco...
TCS
2010
9 years 5 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....
TCS
2010
9 years 5 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
TCS
2010
9 years 5 months ago
Information measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
Luis Filipe Coelho Antunes, Andre Souto
books