Filters: Author is Sonja Georgievska  [Clear All Filters]
S. Georgievska and S. Andova, “Probabilistic CSP: Preserving the Laws via Restricted Schedulers”, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance - 16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012. Proceedings, 2012, vol. 7201, p. 136-150.
S. Georgievska and S. Andova, “Probabilistic may/must testing: retaining probabilities by restricted schedulers”, Formal Asp. Comput., vol. 24, p. 727-748, 2012.