Hi Eric,
Sorry for not replying sooner; we had a visitor to the lab
yesterday.
I've been looking at the concrete semantics, and I'm having
difficulty getting a hand-evaluated example to give the correct
answer:
Suppose we have a simple automaton with two states: 0 and 1
The configuration is
conf = 0 -> true
1 -> { {x -> a} }
There is an edge from 0 to 1 with label A
and there is a self-loop on 1 labelled skip-A
An event then occurs: e = { (A, {x -> a}) }
According to my hand-evaluated calculations, delta(conf, e)
gives
new_conf = 0 -> true
1 -> false
which is incorrect.
Have I just miscalculated, or misunderstood your notation?
Less importantly, you state that true = { \emptyset }, but you have a
stated that a disjunct is a pair of positive bindings and negative
bindings, should true = { (\emptyset, \emptyset) } ?
Thanks,
Julian
Received on Fri Oct 06 12:47:11 2006
This archive was generated by hypermail 2.1.8 : Tue Mar 06 2007 - 16:13:30 GMT