Search

• < Previous
• 1
• Next >

---

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

Parosh Abdulla ; Pritha Mahata ; Richard Mayr.

We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs.&nbsp;[&hellip;]

---

Model Checking Probabilistic Pushdown Automata

Javier Esparza ; Antonin Kucera ; Richard Mayr.

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model&nbsp;[&hellip;]

---

Decisive Markov Chains

Parosh Aziz Abdulla ; Noomene Ben Henda ; Richard Mayr.

We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no longer be reached. While all finite Markov chains&nbsp;[&hellip;]

---