( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Testing Equivalence vs. Runtime Monitoring.

, , , , и . Models, Languages, and Tools for Concurrent and Distributed Programming, том 11665 из Lecture Notes in Computer Science, стр. 28-44. Springer, (2019)

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 Rizzini

Luca Tranchini

Luca Tuninetti

Alfonz Luca

 

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

Guest Editors' Foreword., и . Nord. J. Comput., 9 (1): 69 (2002)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)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)The Best a Monitor Can Do., , , , и . CSL, том 183 из LIPIcs, стр. 7:1-7:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Preface., , и . SOS@CONCUR, том 128 из Electronic Notes in Theoretical Computer Science, стр. 1. Elsevier, (2004)In search of lost time: Axiomatising parallel composition in process algebras., , , , и . LICS, стр. 1-14. IEEE, (2021)Towards Action-Refinement in Process Algebras, и . LICS, стр. 138-145. IEEE Computer Society, (1989)Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)., и . Acta Inf., 54 (1): 1-2 (2017)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)