Efficient guided symbolic reachability using reachability expressions
Asynchronous systems consist of a set of transitions which are non-deterministically chosen and executed. We present a theory of guiding symbolic reachability in such systems by scheduling clusters of transitions. A theory of reachability expressions which specify the schedules is presented. This th...
|Published in:||International Journal on Software Tools for Technology Transfer, Vol. 10, No. 2 (2008), p. 113-129|
|Other Involved Persons:||;|
|Item Description:||D. Thomas was with I.I.T. Bombay when this work was done.|
|QR Code:||Show QR Code|
International Journal on Software Tools for Technology Transfer, Vol. 10, No. 2 (2008), p. 113-129