Volgen
Amrita Suresh
Amrita Suresh
PhD student, ENS Paris Saclay
Geverifieerd e-mailadres voor ens-paris-saclay.fr - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Bounded reachability problems are decidable in FIFO machines
B Bollig, A Finkel, A Suresh
Logical Methods in Computer Science 18, 2022
152022
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
152021
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
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–7