114 search results - page 23 / 23 » A Determinizable Class of Timed Automata |
FOSSACS
2009
Springer
14 years 16 days ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
ISAAC
2003
Springer
13 years 11 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
ICSE
2001
IEEE-ACM
13 years 10 months ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...