( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Inductive Invariants of Regular Abstraction Frameworks.

, , , и . CONCUR, том 311 из LIPIcs, стр. 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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.

Javier Esparza Technical University of Munich

Francisco Javier Esparza Estaun

Javier Dreyer

Javier Papa

Javier Manero

 

Другие публикации лиц с тем же именем

Compositional Synthesis of Live and Bounded Free Choice Petri Nets., и . CONCUR, том 527 из Lecture Notes in Computer Science, стр. 172-187. Springer, (1991)On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs., , и . Fundam. Informaticae, 86 (3): 227-253 (2008)Top-down synthesis of live and bounded free choice nets., и . Applications and Theory of Petri Nets, том 524 из Lecture Notes in Computer Science, стр. 118-139. Springer, (1990)Parameterized Analysis of Immediate Observation Petri Nets., , и . Petri Nets, том 11522 из Lecture Notes in Computer Science, стр. 365-385. Springer, (2019)#conference.Verification of Safety Properties Using Integer Programming: Beyond the State Equation., и . Formal Methods Syst. Des., 16 (2): 159-189 (2000)Reachability in Cyclic Extended Free-Choice Systems., и . Theor. Comput. Sci., 114 (1): 93-118 (1993)Derivation tree analysis for accelerated fixed-point computation., , и . Theor. Comput. Sci., 412 (28): 3226-3241 (2011)Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version).. CoRR, (2014)TheoretiCS., и . Bull. EATCS, (2021)Lower Bounds on the State Complexity of Population Protocols., и . PODC, стр. 45-54. ACM, (2021)