( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The power of reachability testing for timed automata.

, , , и . Theor. Comput. Sci., 300 (1-3): 411-475 (2003)

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.

Leonardo Aceto

Luca Tuninetti

Luca Rizzini

Luca Tranchini

Luca Criscuolo

 

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

Guest Editors' Foreword., и . Nord. J. Comput., 9 (1): 69 (2002)On a Question of A. Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitely Based, , и . Theoretical Computer Science, 209 (1-2): 141--162 (декабря 1998)Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)., и . Acta Inf., 54 (1): 1-2 (2017)On the Ill-Timed but Well-Caused., и . CONCUR, том 715 из Lecture Notes in Computer Science, стр. 97-111. Springer, (1993)Towards Action-Refinement in Process Algebras, и . Inf. Comput., 103 (2): 204-269 (апреля 1993)Preface., , и . SOS@CONCUR, том 128 из Electronic Notes in Theoretical Computer Science, стр. 1. Elsevier, (2004)On Probabilistic Monitorability., , , , , , и . Principles of Systems Design, том 13660 из Lecture Notes in Computer Science, стр. 325-342. Springer, (2022)Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction., , , и . A Journey from Process Algebra via Timed Automata to Model Learning, том 13560 из Lecture Notes in Computer Science, стр. 1-26. Springer, (2022)In search of lost time: Axiomatising parallel composition in process algebras., , , , и . LICS, стр. 1-14. IEEE, (2021)Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?, , , , и . CSL, том 183 из LIPIcs, стр. 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)