Q | |
---|---|
[QBI04] | Michael Melholt Quottrup, Thomas Bak et Roozbeh Izadi-Zamanabadi. Multi-robot planning: a timed automata approach. In ICRA'04, pages 4417-4422. IEEE Robotics & Automation Soc., avril 2004. |
[QS82] | Jean-Pierre Queille et Joseph Sifakis. Specification and verification of concurrent systems in CESAR. In SOP'82, Lecture Notes in Computer Science 137, pages 337-351. Springer-Verlag, avril 1982. |
[QS82] | Jean-Pierre Queille et
Joseph Sifakis.
A Temporal Logic to Deal with Fairness in Transition
Systems.
In FOCS'82,
pages 217-225.
IEEE Comp. Soc. Press, novembre 1982.
|
[QS19] | Karin Quaas et Mahsa Shirmohammadi. Synchronizing Data Words for Register Automata. ACM Transactions on Computational Logic 20(2):11:1-11:27. ACM Press, avril 2019. |
[Qua11] | Karin Quaas. MSO logics for weighted timed automata. Formal Methods in System Design 38(3):193-222. Springer-Verlag, juin 2011. |
[Qua11] | Karin Quaas.
On the Interval-Bound Problem for Weighted Timed
Automata.
In LATA'11,
Lecture Notes in Computer Science 6638, pages 452-464. Springer-Verlag, mai 2011.
|
[QYZ+03] | Lili Qiu, Richard Yang, Yin Zhang et Scott Shenker. On selfish routing in internet-like environments. In SIGCOMM'03, pages 151-162. ACM Press, août 2003. |
[QYZ+06] | Lili Qiu, Richard Yang, Yin Zhang et Scott Shenker. On selfish routing in internet-like environments. IEEE Transactions on Computers 14(4):725-738. IEEE Comp. Soc. Press, août 2006. |
Sélectionner
8 correspondances trouvéesListe des auteurs
- 1
- 1
- 2
- 3
- 2
- 1
- 2
- 1
- 2
- 2
- 2