( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Synthesizing Clock-Efficient Timed Automata.

, и . IFM, том 12546 из Lecture Notes in Computer Science, стр. 276-294. Springer, (2020)

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.

Feliks Gwozdz

Feliks Woroszylski

Feliks Musiol

Feliks Klobasa

Andrzej Feliks Jankowski

 

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

Timed Scenarios: Consistency, Equivalence and Optimization., и . SBMF, том 11254 из Lecture Notes in Computer Science, стр. 215-233. Springer, (2018)Compile Time Garbage Collection for Ground Prolog.. ICLP/SLP, стр. 1490-1505. MIT Press, (1988)Synthesizing Clock-Efficient Timed Automata., и . IFM, том 12546 из Lecture Notes in Computer Science, стр. 276-294. Springer, (2020)Enriching Prolog with S-Unification., и . Declarative Programming, стр. 51-65. Springer, (1991)Operations on Timed Scenarios., и . FORTE, том 13910 из Lecture Notes in Computer Science, стр. 97-114. Springer, (2023)Readable, Runnable Requirements Specifications in SPILL-2., и . PLILP, том 844 из Lecture Notes in Computer Science, стр. 449-450. Springer, (1994)From Scenarios to Timed Automata., и . SBMF, том 10623 из Lecture Notes in Computer Science, стр. 33-51. Springer, (2017)Prolog - a Panacea?, и . Implementations of Prolog, Ellis Horwood/Halsted Press/Wiley, (1984)Spill - A Logic Language for Writing Testable Requirements Specifications., и . Sci. Comput. Program., 28 (2-3): 193-223 (1997)Untangling the Graphs of Timed Automata to Decrease the Number of Clocks., и . IFM, том 13274 из Lecture Notes in Computer Science, стр. 168-187. Springer, (2022)