adjust linear combination coefficients according to sign
if sign(j) <> sign(k) then alpha = abs(j) beta = abs(k)
if sign(j) == sign(k) then alpha = -abs(j) beta = abs(k)
adjust linear combination coefficients according to sign
if sign(j) <> sign(k) then alpha = abs(j) beta = abs(k)
if sign(j) == sign(k) then alpha = -abs(j) beta = abs(k)
Returns the distance between the outside of the component to the centre, in order
to position the centre of the place where the mouse clicks on the screen
Returns the distance between the outside of the component to the centre, in order
to position the centre of the place where the mouse clicks on the screen
generate()
This static method generates the statespace from a GSPN
It uses a hashtable so that it can quickly check whether
a state has already been explored.
displayResults()
Takes the reachability graph file and the steady state distribution
and produces nicely formatted output showing these results plus
more results based on them.
Returns the distance between the outside of the component to the centre, in order to position the centre of the place where the mouse clicks on the screen
ModuleClass encapsulates information about the Module class and is designed to be used as a userobject in nodes in a JTree, in this case for nodes representing module classes.
This function recursively generates potential state spaces from existing state spaces
(as per algorithm written by James Bloom & Clare Clark for PIPE 2003) and adds new state spaces
to the StateList array supplied as a parameter.
renderAverages()
Turns the array containing the average number of
tokens on a place into a table in the form of a long
string with embedded HTML ready for display.
This is the 3rd version of SwingWorker (also known as
SwingWorker 3), an abstract class that you subclass to
perform GUI-related work in a dedicated thread.
Returns the distance between the outside of the component to the centre, in order to position the centre of the place where the mouse clicks on the screen
Unite two sets (arrays of integers) so that if there is a common entry in the
arrays it appears only once, and all the entries of each array appear in the
union.
updateRate()
When recording a transition from one state to another,
it is possible that there will be multiple paths between
them through vanishing states.