( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Executable requirements Specifications in a Logic Specification Language SPILL-2.

, и . ICLP Workshop: Applications of Logic Programming to Software Engineering, (1994)

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)Synthesizing Timed Automata with Minimal Numbers of Clocks from Optimised Timed Scenarios., и . FORTE, том 14678 из Lecture Notes in Computer Science, стр. 136-154. Springer, (2024)Untangling the Graphs of Timed Automata to Decrease the Number of Clocks., и . IFM, том 13274 из Lecture Notes in Computer Science, стр. 168-187. Springer, (2022)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)Clock Allocation in Timed Automata and Graph Colouring., и . HSCC, стр. 71-80. ACM, (2018)Optimization of Timed Scenarios., и . SBMF, том 12475 из Lecture Notes in Computer Science, стр. 119-136. Springer, (2020)An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata., и . SBMF, том 13768 из Lecture Notes in Computer Science, стр. 3-21. Springer, (2022)Minimization of the Number of Clocks for Timed Scenarios., и . SBMF, том 13130 из Lecture Notes in Computer Science, стр. 122-139. Springer, (2021)Compile Time Garbage Collection for Ground Prolog.. ICLP/SLP, стр. 1490-1505. MIT Press, (1988)