942 search results - page 140 / 189 » Interrupt Timed Automata |
ATVA
2006
Springer
14 years 17 days ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
BIRTHDAY
2008
Springer
13 years 10 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...
CORR
2010
Springer
13 years 9 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...
ENTCS
2008
13 years 9 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...
ENTCS
2006
13 years 8 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...