A Visualization Modeling Framework for a CSP-Based System

An alarm management framework for automated network fault identification

“…Therefore, for this issue, our developed SD 2 provides 'cluster' and 'uncluster' functions (the 'cluster' and 'uncluster' buttons on the menu bar of the window in Fig. 11) to let users change the size of a Petri Net [16]. Users can designate a desired area in the window's canvas, and then 'cluster' it into a representative icon embedded within the Petri Net graph.…”

“…The textual file is then decomposed by CSP Transformation Subsystem into several cooperative C program files including embedded monitor calls. The corresponding Petri nets and IPC dataflow are also produced automatically [16]. The timing constraint parameters of each transition of the TCPN are assigned by the user.…”

“…Assignments of transitions/places in Fig. 11 t s : system starts or system forks processes p a=d 5 : message from process A to process D is on the way t a 1 : process A multicasts p a 6 : process A has received all the desired responses t a 2 : process A receives responses non-deterministicly p a 7 : process A releases all the occupied resources t a 3 : process A ends p b 8 : process B is ready t b 4 : process B receives message from process A p b 9 : process B prepares the process identifier t b 5 : process B sends process identifier to process A p b 10 : process B has sent response t b 6 : process B ends p b=a 11 : response from process B to process A is on the way t c 7 : process C receives message from process A p b 12 : process B releases all the occupied resources t c 8 : process C sends process identifier to process A p c 13 : process C is ready t c 9 : process C ends p c 14 : process C prepares the process identifier t d 10 : process D receives message from process A p c 15 : process C has sent response t d 11 : process D sends process identifier to process A p c=a 16 : response from process C to process A is on the way t d 12 : process D ends p c 17 : process C releases all the occupied resources t e : system ends p d 18 : process D is ready p s : system is ready p d 19 : process D prepares the process identifier p a 1 : process A is ready p d 20 : process D has sent response p a 2 : process A is waiting the receiving messages p d=a 21 : response from process D to process A is on the way p a=b 3 : message from process A to process B is on the way p d 22 : process D releases all the occupied resources p a=c 4 : message from process A to process C is on the way p e : system stops Appendix B. Assignments of timing constraints in Fig.…”