495 search results - page 81 / 99 » Automata and differentiable words |
ESORICS
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and...
FAC
2008
13 years 8 months ago
2008
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
ENTCS
2006
13 years 8 months ago
2006
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
TCS
2002
13 years 7 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...