Sciweavers

906 search results - page 98 / 182
» Linking Theories of Concurrency
Sort
View
CORR
2008
Springer
79views Education» more  CORR 2008»
14 years 10 months ago
A System Theoretic Approach to Bandwidth Estimation
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed i...
Jörg Liebeherr, Markus Fidler, Shahrokh Valae...
DISOPT
2008
81views more  DISOPT 2008»
14 years 10 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
JEI
2007
144views more  JEI 2007»
14 years 9 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
FOSSACS
2009
Springer
15 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
SEFM
2006
IEEE
15 years 3 months ago
Product Automata and Process Algebra
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
Kamal Lodaya