With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show t...
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...