( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Statecharts, Transition Structures and Transformations.

. TAPSOFT, том 915 из Lecture Notes in Computer Science, стр. 454-468. Springer, (1995)

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.

Joseph Peron

Adriano Aebli

Adriano Zanier

Vincent Péron

Barbara Peron

 

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

Undecidability of future timeline-based planning over dense temporal domains., , , и . CoRR, (2019)Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic., , и . TIME, том 147 из LIPIcs, стр. 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments., , , , и . IJCAR, том 9706 из Lecture Notes in Computer Science, стр. 389-405. Springer, (2016)Model Checking Timeline-Based Systems over Dense Temporal Domains., , , и . ICTCS, том 2504 из CEUR Workshop Proceedings, стр. 235-247. CEUR-WS.org, (2019)Undecidability of Future Timeline-based Planning over Dense Temporal Domains?, , , и . ICTCS, том 2756 из CEUR Workshop Proceedings, стр. 155-166. CEUR-WS.org, (2020)Web Application Testing: Using Tree Kernels to Detect Near-duplicate States in Automated Model Inference., , , и . ESEM, стр. 37:1-37:6. ACM, (2021)Event-Clock Nested Automata., , и . LATA, том 10792 из Lecture Notes in Computer Science, стр. 80-92. Springer, (2018)Analysis of Timed Recursive State Machines., , и . TIME, стр. 61-68. IEEE Computer Society, (2010)Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS., , и . TIME, стр. 90-100. IEEE Computer Society, (2015)The lecture video recording in university: A case study., , , , и . EMOOCs-WIP, том 2356 из CEUR Workshop Proceedings, стр. 175-180. CEUR-WS.org, (2019)