( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reducing Bounded Realizability Analysis to Reachability Checking.

, , и . RP, том 9328 из Lecture Notes in Computer Science, стр. 140-152. Springer, (2015)

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.

Naoki Yoshida

Naoki Ueda

Naoki Fukuzawa

Naoki Tamura

Naoki Saito

 

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

Qualitative Analysis of Gene Regulatory Networks using Network Motifs., , , , , и . BIOINFORMATICS, стр. 15-24. SciTePress, (2013)An Efficient Verification Procedure Supporting Evolution of Reactive System Specifications., , и . IWPSE, стр. 182-185. ACM, (2001)Verification of Verifiability of Voting Protocols by Strand Space Analysis., , и . ICSCA, стр. 363-368. ACM, (2019)Minimal strongly unsatisfiable subsets of reactive system specifications., , , и . ASE, стр. 629-634. ACM, (2014)A parallel programming language and description of scheduler., , , и . Operating Systems Engineering, том 143 из Lecture Notes in Computer Science, стр. 23-41. Springer, (1980)A Model for Perception of Structural Image Feature., , и . IJCAI, стр. 257-259. William Kaufmann, (1979)Resolution Method for Modal Logic with Well-Founded Frames., и . CSL, том 1683 из Lecture Notes in Computer Science, стр. 277-291. Springer, (1999)Qualitative Analysis of Gene Regulatory Networks by Satisfiability Checking of Linear Temporal Logic., , , и . BIBE, стр. 232-237. IEEE Computer Society, (2010)More Expressive Temporal Logic for Specifications., и . SEKE, стр. 363-366. Knowledge Systems Institute, (1993)Logical environments for natural language approach., , и . ISPW, стр. 84-86. ACM, (1985)ACM SIGSOFT Software Engineering Notes 11(4), August 1986.