Finite-Trace Analysis of Stochastic Systems with Silent Transitions (Extended Abstract)

Abstract

In this paper, we summarise the main technical results obtained for specification probability. That is, we compute the probability that if a bounded stochastic Petri net produces a trace, that trace satisfies a given specification.

Cite

Text

Leemans et al. "Finite-Trace Analysis of Stochastic Systems with Silent Transitions (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/719

Markdown

[Leemans et al. "Finite-Trace Analysis of Stochastic Systems with Silent Transitions (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/leemans2023ijcai-finite/) doi:10.24963/IJCAI.2023/719

BibTeX

@inproceedings{leemans2023ijcai-finite,
  title     = {{Finite-Trace Analysis of Stochastic Systems with Silent Transitions (Extended Abstract)}},
  author    = {Leemans, Sander J. J. and Maggi, Fabrizio Maria and Montali, Marco},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {6452-6457},
  doi       = {10.24963/IJCAI.2023/719},
  url       = {https://mlanthology.org/ijcai/2023/leemans2023ijcai-finite/}
}