팔로우
Amrita Suresh
Amrita Suresh
PhD student, ENS Paris Saclay
ens-paris-saclay.fr의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Bounded reachability problems are decidable in FIFO machines
B Bollig, A Finkel, A Suresh
Logical Methods in Computer Science 18, 2022
162022
A unifying framework for deciding synchronizability
B Bollig, C Di Giusto, A Finkel, L Laversa, E Lozes, A Suresh
CONCUR 2021-32nd International Conference on Concurrency Theory, 1-33, 2021
162021
Branch-Well-Structured Transition Systems and Extensions
B Bollig, A Finkel, A Suresh
International Conference on Formal Techniques for Distributed Objects …, 2022
22022
Formal Verification of Communicating Automata
A Suresh
Université Paris-Saclay, 2022
2022
Verification of FIFO Systems
A Suresh
2021
Termination, Boundedness and Reachability for Input-bounded FIFO Machines
A Suresh
2019
Verification of Population Protocols
A Suresh
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–7