1246 search results - page 154 / 250 » Recursive Timed Automata |
126
click to vote
BIRTHDAY
2008
Springer
15 years 7 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
125
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
124
Voted
ENTCS
2008
15 years 5 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
130
click to vote
ENTCS
2006
15 years 5 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
173
Voted
IPL
2008
15 years 5 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...