Search

• < Previous
• 1
• Next >

---

Priced Timed Petri Nets

Richard M. Mayr ; Parosh Aziz Abdulla.

We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing&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;]

---

Mending Fences with Self-Invalidation and Self-Downgrade

Parosh Aziz Abdulla ; Mohamed Faouzi Atig ; Stefanos Kaxiras ; Carl Leonardsson ; Alberto Ros ; Yunyun Zhu.

Cache coherence protocols based on self-invalidation and self-downgrade have recently seen increased popularity due to their simplicity, potential performance efficiency, and low energy consumption. However, such protocols result in memory instruction reordering, thus causing extra program behaviors&nbsp;[&hellip;]

---

A Load-Buffer Semantics for Total Store Ordering

Parosh Aziz Abdulla ; Mohamed Faouzi Atig ; Ahmed Bouajjani ; Tuan Phong Ngo.

We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Known decision procedures for this model are based on complex encodings of store buffers as lossy channels. These procedures assume that the number of processes is&nbsp;[&hellip;]

---