Sciweavers

5639 search results - page 63 / 1128
» Timed Abstract Non-interference
Sort
View
JGAA
2007
123views more  JGAA 2007»
14 years 11 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
TVCG
2008
81views more  TVCG 2008»
14 years 11 months ago
Visual Methods for Analyzing Time-Oriented Data
Abstract--Providing appropriate methods to facilitate the analysis of time-oriented data is a key issue in many application domains. In this paper, we focus on the unique role of t...
Wolfgang Aigner, Silvia Miksch, Wolfgang Müll...
DATESO
2010
150views Database» more  DATESO 2010»
14 years 10 months ago
Modeling and Verification of Priority Assignment in Real-Time Databases Using Uppaal
Abstract. Real-time database management systems (RTDBMS) are recently subject of an intensive research. Model checking algorithms and verification tools are of great concern as wel...
Martin Kot
TAPSOFT
1995
Springer
15 years 3 months ago
Comparing Flow-Based Binding-Time Analyses
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
Jens Palsberg
FOSSACS
2009
Springer
15 years 6 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr