7988 search results - page 221 / 1598 » A Useful Undecidable Theory |
CONCUR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
133
click to vote
ATVA
2010
Springer
15 years 1 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
112
click to vote
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
92
Voted
FAC
2008
15 years 22 days 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...
115
click to vote
ENTCS
2007
15 years 19 days ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...