( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast Translation from LTL to Büchi Automata via Non-transition-based Automata.

, , , и . ICFEM, том 8829 из Lecture Notes in Computer Science, стр. 364-379. Springer, (2014)

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.

Shigeki Nagai

Saori Hagihara

Shigeki Tomo

 

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

Reducing Bounded Realizability Analysis to Reachability Checking., , и . RP, том 9328 из Lecture Notes in Computer Science, стр. 140-152. Springer, (2015)A Qualitative Framework for Analysing Homeostasis in Gene Networks., , и . BIOINFORMATICS, стр. 5-16. SciTePress, (2014)A Temporal Logic with Mean-Payoff Constraints., , , и . ICFEM, том 7635 из Lecture Notes in Computer Science, стр. 249-265. Springer, (2012)Simple synthesis of reactive systems with tolerance for unexpected environmental behavior., , , , и . FormaliSE@ICSE, стр. 15-21. ACM, (2016)Verification of Verifiability of Voting Protocols by Strand Space Analysis., , и . ICSCA, стр. 363-368. ACM, (2019)Qualitative Analysis of Gene Regulatory Networks using Network Motifs., , , , , и . BIOINFORMATICS, стр. 15-24. SciTePress, (2013)Minimal strongly unsatisfiable subsets of reactive system specifications., , , и . ASE, стр. 629-634. ACM, (2014)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)SAT-Based Bounded Strong Satisfiability Checking of Reactive System Specifications., , и . ICT-EurAsia, том 7804 из Lecture Notes in Computer Science, стр. 60-70. Springer, (2013)