Potential requirement: LTS and script generation

Underlying business process description languages (whether
of private or public process) there is a “bare bones” state
transition graph, where each state transition is governed by some assertion or
condition under which the transition occurs. Such graphs should be convertible
into “rules” and other testable script elements by a statement of
the form:

 

When in State A and Condition C becomes true, then the
result will be State B.

 

So the requirement is to show how to take (one or more)
business description languages, and extract a “canonical” LTS that
we can then transform (e.g., using XSLT) to a testing and/or monitoring script
in ETSL or similar.