( en | de | ru )

 

Disambiguation of "Esparza, Javier"

Author of the publication

copydeleteadd this publication to your clipboard
Trapping Mutual Exclusion in the Box Calculus.

, and . Theor. Comput. Sci., 153 (1&2): 95-128 (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Javier Esparza Technical University of Munich

Francisco Javier Esparza Estaun

Javier Manero

Javier Jáurequi

Javier Dreyer

 

Other publications of authors with the same name

Three Case Studies on Verification of Infinite-State Systems., and . Modern Applications of Automata Theory, volume 2 of IISc Research Monographs Series, World Scientific, (2012)The Complexity of Verifying Population Protocols., , , and . (2019)From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata, , , and . International Journal on Software Tools for Technology Transfer, 24 (4): 635--659 (2022)Complexity of Verification and Synthesis of Threshold Automata., , and . CoRR, (2020)https://arxiv.org/abs/2007.06248.Expressive Power of Oblivious Consensus Protocols, , and . (2019)Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy., , and . FoSSaCS, volume 12650 of Lecture Notes in Computer Science, page 42-61. Springer, (2021)Back to the Future: A Fresh Look at Linear Temporal Logic.. CIAA, volume 12803 of Lecture Notes in Computer Science, page 3-13. Springer, (2021)An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata., and . LICS, page 831-844. ACM, (2020)The complexity of verifying population protocols., , , and . Distributed Comput., 34 (2): 133-177 (2021)Parameterized Verification of Asynchronous Shared-Memory Systems., , and . J. ACM, 63 (1): 10:1-10:48 (2016)