Search

• < Previous
• 1
• Next >

---

Power of Randomization in Automata on Infinite Strings

Rohit Chadha ; A. Prasad Sistla ; Mahesh Viswanathan.

Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined. In this paper, we present a number of results that clarify the power&nbsp;[&hellip;]

---

Reachability under Contextual Locking

Remi Bonnet ; Rohit Chadha ; Mahesh Viswanathan ; P. Madhusudan.

The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the program. The problem is important for static analysis and is used to detect statements that are concurrently enabled. This&nbsp;[&hellip;]

---