732 search results - page 66 / 147 » Axiomatising timed automata |
CORR
2000
Springer
13 years 8 months ago
2000
Springer
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...
GPCE
2007
Springer
14 years 3 months ago
2007
Springer
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...
ICALP
2000
Springer
14 years 14 days ago
2000
Springer
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...
JLP
2010
13 years 3 months ago
2010
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 ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract-- In this paper we extend the work on dynamic observers for fault diagnosis [1], [2], [3] to timed automata. We study sensor minimization problems with static observers an...