N | |
---|---|
[dN86] | Rocco de Nicola.
Extensional Equivalences for Transitions Systems.
Acta Informatica 24(2):211-237. Springer-Verlag, 1986.
|
[Nas50] | John F. Nash. Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences 36(1):48-49. National Academy of Sciences of the United States of America, janvier 1950. |
[Nas51] | John F. Nash.
Non-cooperative Games.
Annals of Mathematics 54(2):286-295. Princeton University Press, septembre 1951.
|
[NB07] | Sriram Narasimhan et Gautam Biswas. Model-Based Diagnosis of Hybrid Systems. IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans 37(3):348-361. IEEE, mai 2007. |
[dNH84] | Rocco de Nicola et
Matthew C. B. Hennessy.
Testing Equivalence for Processes.
Theoretical Computer Science 34:83-133. Elsevier, 1984.
|
[Nic08] | Dejan Nickovic.
Checking Timed and Hybrid Properties: Theory and
Applications.
PhD thesis,
Lab. VERIMAG, Grenoble, France,
Octobre 2008.
|
[Nic19] | Cyril Nicaud. The Černý conjecture holds with high probability. Journal of Automata, Languages and Combinatorics 24(2-4):343-365. 2019. |
[Nie02] | Frank Nießner.
Non-deterministic tree automata.
In Erich Grädel,
Wolfgang Thomas et
Thomas Wilke (eds.),
Automata, Logics, and Infinite Games,
Lecture Notes in Computer Science 2500, pages 227-232. Springer-Verlag, 2002.
|
[Nis94] | Noam Nisan.
RL ⊆SC.
Computational Complexity 4:1-11. Birkhäuser, 1994.
|
[Niw97] | Damian Niwiński. Fixed point characterization of infinite behavior of finite-state systems. Theoretical Computer Science 189(1-2):1-69. Elsevier, décembre 1997. |
[Niw02] | Damian Niwiński.
μ-calculus via Games.
In CSL'02,
Lecture Notes in Computer Science 2471, pages 27-43. Springer-Verlag, septembre 2002.
|
[NJM+22] | Reiya Noguchi, Thierry Jéron, Nicolas Markey et Ocan Sankur. Method and system for testing the operation of a target computer system by using timed requirements. Brevet EP 3 907 615 B1, novembre 2022, |
[NJM+23] | Reiya Noguchi, Thierry Jéron, Nicolas Markey et Ocan Sankur. Method and system for correcting the operation of a target computer system by using timed requirements. Brevet EP 4 064 057 B1, juillet 2023, |
[NOK10] | Takeshi Nagaoka, Kozo Okano et Shinji Kusumoto. An abstraction refinement technique for timed automata based on counterexample-guided abstraction refinement loop. IEICE Transactions on Information and Systems 5(5):994-1005. Institute of Electronics, Information and Communication Engineers, mai 2010. |
[NOS+93] | Xavier Nicollin,
Alfredo Olivero,
Joseph Sifakis et
Sergio Yovine.
An Approach to the Description and Analysis of
Hybrid Systems.
In HSCC'92,
Lecture Notes in Computer Science 736, pages 149-178. Springer-Verlag, 1993.
|
[NRT+07] | Noam Nisan, Tim Roughgarden, Éva Tardos et Vijay V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007. |
[NS89] | Maurice Nivat et Ahmed Saoudi. Automata on Infinite Objects and Their Applications to Logic and Programming. Information and Computation 83(1):41-64. Academic Press, octobre 1989. |
[NS03] | Brian Nielsen et Arne Skou. Automated test generation from timed automata. International Journal on Software Tools for Technology Transfer 5(1):59-77. Springer-Verlag, novembre 2003. |
[NSJ+22] | Reiya Noguchi, Ocan Sankur, Thierry Jéron, Nicolas Markey et David Mentré. Repairing Real-Time Requirements. In ATVA'22, Lecture Notes in Computer Science 13505, pages 371-387. Springer-Verlag, octobre 2022. |
[NSL+12] | Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong et Yan Liu. Improved BDD-Based Discrete Analysis of Timed Systems. In FM'12, Lecture Notes in Computer Science 7436, pages 326-340. Springer-Verlag, août 2012. |
[NTS95] | Noam Nisan et
Amnon Ta-Shma.
Symmetric LOGSPACE is Closed Under Complement.
In STOC'95,
pages 140-146.
ACM Press, mai 1995.
|
[NU02] | Matti Nykänen et Esko Ukkonen. The Exact Path Length Problem. Journal of Algorithms 42(1):41-53. Elsevier, janvier 2002. |
[dNV90] | Rocco de Nicola et Frits Vaandrager. Action versus state based logics for transition systems. In Semantics of Systems of Concurrent Processes, Lecture Notes in Computer Science 469, pages 407-419. Springer-Verlag, avril 1990. |
[NYY92] | Anil Nerode,
Alexander Yakhnis et
Vladimir Yakhnis.
Concurrent programs as strategies in games.
In Logic from Computer Science,
Mathematical Sciences Research Institute
Publications 21, pages 405-479. Springer-Verlag, 1992.
|
Sélectionner
24 correspondances trouvéesListe des auteurs
- 1
- 3
- 1
- 1
- 3
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 2
- 3
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1