6 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.LO2025
Unreliability in Practical Subclasses of Communicating Systems
Amrita Suresh, Nobuko Yoshida
Systems of communicating automata are prominent models for peer-to-peer message-passing over unbounded channels, but in the general scenario, most verification properties are undec…
cs.LO2022
Branch-Well-Structured Transition Systems and Extensions
Benedikt Bollig, Alain Finkel, Amrita Suresh
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination. In this class, the well…
cs.LO2021★ 6 cited
Bounded Reachability Problems are Decidable in FIFO Machines
Benedikt Bollig, Alain Finkel, Amrita Suresh
The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for th…