3 search results - page 1 / 1 » Two-by-Two Substitution Systems and the Undecidability of th... |
CIE
2008
Springer
13 years 7 months ago
2008
Springer
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
FCT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...