Sciweavers

427 search results - page 30 / 86
» On the Power of Labels in Transition Systems
Sort
View
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
14 years 9 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
LICS
1999
IEEE
15 years 4 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
15 years 5 months ago
Online energy-aware I/O device scheduling for hard real-time systems
Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of...
Hui Cheng, Steve Goddard
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 12 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
LATA
2010
Springer
14 years 10 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno