Sciweavers

921 search results - page 71 / 185
» On Interleaving in Timed Automata
Sort
View
CORR
2000
Springer
133views Education» more  CORR 2000»
15 years 6 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
VTC
2006
IEEE
160views Communications» more  VTC 2006»
16 years 9 days ago
Chip-interleaved Multi-rate CDMA with 2-dimensional OVSF Spreading
—Chip interleaving technique has been proposed for DS-CDMA to eliminate the multiple-access interference (MAI). In this paper, we develop this technique to provide the single- or...
Le Liu, Fumiyuki Adachi
GPCE
2007
Springer
16 years 14 days ago
Aspects of availability
In this paper, we propose a domain-specific aspect language to prevent the denials of service caused by resource management. Our aspects specify availability policies by enforcin...
Pascal Fradet, Stéphane Hong Tuan Ha
ICALP
2000
Springer
15 years 10 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
JLP
2010
105views more  JLP 2010»
15 years 1 months ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen