Both sides previous revisionPrevious revisionNext revision | Previous revision |
main [2021/12/13 12:54] – [How to install and use] andrea | main [2021/12/13 13:04] (current) – [Access to EPMC] andrea |
---|
* Bounded responsibility property, ''(G req<sub>1</sub> => F<sup>%%<=%%bound</sup> reply<sub>1</sub>)& ... & (G req<sub>n</sub> => F<sup>%%<=%%bound</sup> reply<sub>n</sub>)'': for a family of components, each component ''i'' replies to a given request within a given time bound. | * Bounded responsibility property, ''(G req<sub>1</sub> => F<sup>%%<=%%bound</sup> reply<sub>1</sub>)& ... & (G req<sub>n</sub> => F<sup>%%<=%%bound</sup> reply<sub>n</sub>)'': for a family of components, each component ''i'' replies to a given request within a given time bound. |
* Bounded responsibility property with fairness, ''(GF req<sub>1</sub> & ... & GF req<sub>n</sub>) & (G req<sub>1</sub> => F<sup>%%<=%%bound</sup> reply<sub>1</sub>) & ... & (G req<sub>n</sub> => F<sup>%%<=%%bound</sup> reply<sub>n</sub>)'': similar to bounded responsibility, suitable for ''P<sub>max=?</sub>'' in MDPs. The fairness ensures that the system is scheduled such that the request occurs infinitely often. | * Bounded responsibility property with fairness, ''(GF req<sub>1</sub> & ... & GF req<sub>n</sub>) & (G req<sub>1</sub> => F<sup>%%<=%%bound</sup> reply<sub>1</sub>) & ... & (G req<sub>n</sub> => F<sup>%%<=%%bound</sup> reply<sub>n</sub>)'': similar to bounded responsibility, suitable for ''P<sub>max=?</sub>'' in MDPs. The fairness ensures that the system is scheduled such that the request occurs infinitely often. |
* Bounded responsibility property with fairness, ''(GF req<sub>1</sub> & ... & GF req<sub>n</sub>) => ((G req<sub>1</sub> => F<sup>%%<=%%bound</sup> reply<sub>1</sub>) & ... & (G req<sub>n</sub> => F<sup>%%<=%%bound</sup> reply<sub>n</sub>))'': similar to bounded responsibility, suitable for ''P<sub>min=?</sub>'' in MDPs. The fairness ensures that the system is scheduled such that the request occurs infinitely often. | * Bounded responsibility property with fairness, ''(GF req<sub>1</sub> & ... & GF req<sub>n</sub>) => %%((%%G req<sub>1</sub> => F<sup>%%<=%%bound</sup> reply<sub>1</sub>) & ... & (G req<sub>n</sub> => F<sup>%%<=%%bound</sup> reply<sub>n</sub>%%))%%'': similar to bounded responsibility, suitable for ''P<sub>min=?</sub>'' in MDPs. The fairness ensures that the system is scheduled such that the request occurs infinitely often. |
| |
---- | ---- |
===== Access to EPMC ===== | ===== Access to EPMC ===== |
* Download: EPMC is now available publicly. It can be obtained on GitHub, at [[https://github.com/ISCAS-PMC/ePMC|this repository]]. \\ Please follow our [[https://github.com/ISCAS-PMC/ePMC/wiki/Documentations|wiki documentations]] to build and use EPMC. | * Download: EPMC is now available publicly. It can be obtained on GitHub, at [[https://github.com/ISCAS-PMC/ePMC|this repository]]. \\ Please follow our [[https://github.com/ISCAS-PMC/ePMC/wiki/Documentations|wiki documentations]] to build and use EPMC. |
* Online version of EPMC is available [[https://iscasmc.ios.ac.cn/IscasMC/user/center|here]]. Screenshot of EPMC online: | * Online version of EPMC is available [[https://tis.ios.ac.cn/IscasMC/login/login|here]]. Screenshot of EPMC online: |
| |
{{:epmc-web.png}} | {{:epmc-web.png}} |
The following are projects related to EPMC: | The following are projects related to EPMC: |
* [[http://faculty.sist.shanghaitech.edu.cn/faculty/songfu/Projects/pamc/epmc-pamc/|EPMC-PAMC]]: A model checker for probabilistic alternating-time Mu-Calculus. | * [[http://faculty.sist.shanghaitech.edu.cn/faculty/songfu/Projects/pamc/epmc-pamc/|EPMC-PAMC]]: A model checker for probabilistic alternating-time Mu-Calculus. |
| * [[https://iscasmc.ios.ac.cn/dpctl/doku.php|dpCTL]]: A model checker for differentially privacy verification. |
* [[https://iscasmc.ios.ac.cn/roll/doku.php|ROLL]]: A learning based tool for models inferring. | * [[https://iscasmc.ios.ac.cn/roll/doku.php|ROLL]]: A learning based tool for models inferring. |
| |