( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Logic Programming Foundations of Cyber-Physical Systems.

. ICLP (Technical Communications), том 7 из LIPIcs, стр. 289-293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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.

Viktoriia Nedashkivska

Neda Daryab

Neda Dadashi

Neda Nabavi

Neda Lotfiomran

 

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

Infinite Computation, Co-induction and Computational Logic., , , , , и . CALCO, том 6859 из Lecture Notes in Computer Science, стр. 40-54. Springer, (2011)Synthesizing Clock-Efficient Timed Automata., и . IFM, том 12546 из Lecture Notes in Computer Science, стр. 276-294. Springer, (2020)LTL Model Checking using Coinductive Answer Set Programming., , , , и . ICLP Workshops, том 3193 из CEUR Workshop Proceedings, CEUR-WS.org, (2022)Operations on Timed Scenarios., и . FORTE, том 13910 из Lecture Notes in Computer Science, стр. 97-114. Springer, (2023)Timed Scenarios: Consistency, Equivalence and Optimization., и . SBMF, том 11254 из Lecture Notes in Computer Science, стр. 215-233. Springer, (2018)Timed π-Calculus., и . TGC, том 8358 из Lecture Notes in Computer Science, стр. 119-135. Springer, (2013)Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)., и . LATA, том 6031 из Lecture Notes in Computer Science, стр. 536-548. Springer, (2010)Synthesizing Timed Automata with Minimal Numbers of Clocks from Optimised Timed Scenarios., и . FORTE, том 14678 из Lecture Notes in Computer Science, стр. 136-154. Springer, (2024)From Scenarios to Timed Automata., и . SBMF, том 10623 из Lecture Notes in Computer Science, стр. 33-51. Springer, (2017)Untangling the Graphs of Timed Automata to Decrease the Number of Clocks., и . IFM, том 13274 из Lecture Notes in Computer Science, стр. 168-187. Springer, (2022)