VEiP - Verification and Enforcement using Insertion for oPacity
VEiP is a Java based toolbox for verification and enforcement of opacity properties formulated in Discrete Event Systems. While some features are still under development, VEiP can be downloaded for features that are already implemented. The full version of VEiP expects to provide the following functionality:
- Verification of opacity
- Synthesis of an insertion function that enforces opacity
- Synthesis of an optimal insertion function that minimizes insertion cost (under developement)
- Computation of the level of opacity
- Synthesis of an optimal insertion function that maximizes opacity level
VEiP was developed by Yi-Chin Wu while she was a postdoc with the University of Michigan, Ann Arbor, and the University of California, Berkeley. It is distributed under BSD 3-Clause license. As of Dec. 2016, this repository is no longer updated. The current version of VEiP can be found at https://gitlab.eecs.umich.edu/M-DES-tools.
Access, Modify, Build
To access, modify, build, and use the code, follow the instructions below:
Install git if it is not already installed.
In a Linux environment, enter a directory where you would like to clone the file structure. EXAMPLE:
$ mkdir VEiP
$ cd VEiP
Clone the remote repositoty onto your machine.
$ git clone https://github.com/eugene7505/
Enter the main directory (the directory one level above src/) and compile the java applications.
$ javac -d ./bin/ -cp ./src/ src/veip/verification/VerificationMain.java
$ javac -d ./bin/ -cp src/ src/veip/synthesis/SynthesisMain.java
If the compile is successful, all byte-codes should have been written to bin/.
$ cd ./bin
- Verification. EXAMPLE:
- Verify logical opacity: $ java veip.verification.VerificationMain -f ../testFSM/test1/G.fsm
- Compute opacity level: $ java veip.verification.VerificationMain -p ../testFSM/stochastic/H.pfa
- Synthesis. EXAMPLE:
- Synthesis an insertion function: $ java veip.synthesis.SynthesisMain -g ../testFSM/test2/G.fsm ../testFSM/test2/IA.fsm
- Synthesis an insertion function maximizing the opacity level: $ java veip.verification.VerificationMain -s ../testFSM/acc2015RunningExample/H.pfa ../testFSM/acc2015RunningExample/IA.fsm
Automata File Formats
Two models are considered:
- Finite-State Automata (FSA)
The .fsm format used in VEiP is adapted from the .fsm format used in DESUMA (https://wiki.eecs.umich.edu/desuma/index.php/DESUMA). The .fsm format here allows multiple initial states; also, controllability feature for events is removed because it is irrelevant to the insertion mechanism. Below is a sample .fsm file:
2 1 //number of states, number of initial states
state0 1 1 //state name, whether it is marked, number of outgoing transitions
a state1 uo //transition event, next state, whether the event is observable
state1 0 1
b state0 o
- Probabilistic Finite-State Automata (PFA)
The file format is similar to .fsm file format. We add initial probability distribution to every state and transition probability to every transition from a state. Below is a sample .pfa file:
2 //number of states
state0 1 2 0.5 //state name, whether it is marked, number of outgoing transitions, initial probability
a state1 uo 0.7 //transition event, next state, whether the event is observable, transition probability
b state0 o 0.3
state1 0 1 0.5
b state0 o 1
Questions? Send email to ycwu[at]umich[dot]edu
This work was supported in part by the NSF Expeditions in Computing project ExCAPE: Expeditions in Computer Augmented Program Engineering (grant CCF-1138860), and in part by the TerraSwarm Research Center, one of six centers supported by the STARnet phase of the Focus Cen- ter Research Program (FCRP) a Semiconductor Research Corporation program sponsored by MARCO and DARPA.