J | |
---|---|
[Jaz19] | Samy Jaziri. Automata on timed structures. PhD thesis, École Normale Supérieure de Cachan, France, Septembre 2019. |
[JBB+17] | Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martin Seidl, Leander Tentrup et Adam Walker. The first reactive synthesis competition (SYNTCOMP 2014). International Journal on Software Tools for Technology Transfer 19(3):367-390. Springer-Verlag, juin 2017. |
[JdB+09] | Mohammad Mahdi Jaghoori,
Frank S. de Boer,
Tom Chothia et
Marjan Sirjani.
Schedulability of asynchronous real-time concurrent
objects.
Journal of Logic and Algebraic Programming 78(5):402-416. Elsevier, mai 2009.
|
[JD05] | Wojciech Jamroga et
Jürgen Dix.
Do Agents Make Model Checking Explode
(Computationally)?.
In CEEMAS'05,
Lecture Notes in Artificial Intelligence 23690, pages 398-407. Springer-Verlag, septembre 2005.
|
[JD06] | Wojciech Jamroga et
Jürgen Dix.
Model Checking Abilities of Agents: A Closer Look.
Technical Report IfI-06-02, Institut fúr Informatik, Technische
Universität Clausthal, Germany, 2006.
|
[JD08] | Wojciech Jamroga et Jürgen Dix. Model Checking Abilities of Agents: A Closer Look. Theory of Computing Systems 42(3):366-410. Springer-Verlag, avril 2008. |
[Jer03] | Thierry Jéron.
Project-Team VerTeCs.
Annual Reviews Inc., IRISA, Rennes, France, 2003.
|
[Jer04] | Thierry Jéron.
Contribution à la génération automatique
de tests pour les systèmes réactifs.
Mémoire d'habilitation,
Université Rennes 1, France,
Février 2004.
|
[JGB97] | Predrag Janičić,
Ian Green et
Alan Bundy.
A Comparison of Decision Procedures in Presburger
Arithmetic.
In LIRA'97,
pages 91-101.
Septembre 1997.
|
[JvdH04] | Wojciech Jamroga et
Wiebe van der Hoek.
Agents that Know How to Play.
Fundamenta Informaticae 63(2-3):185-219. IOS Press, 2004.
|
[JvdH+05] | Wojciech Jamroga,
Wiebe van der Hoek et
Michael Wooldridge.
Intentions and Strategies in Game-Like Scenarios.
In EPIA'05,
Lecture Notes in Artificial Intelligence 3808, pages 512-523. Springer-Verlag, décembre 2005.
|
[JKP16] | Wojciech Jamroga,
Beata Konikowska et
Wojciech Penczek.
Multi-Valued Verification of Strategic Ability.
In AAMAS'16,
pages 1180-1189.
International Foundation for Autonomous Agents and
Multiagent Systems, mai 2016.
|
[JL03] | Jan Johannsen et
Martin Lange.
CTL+ is Complete for Double Exponential
Time.
In ICALP'03,
Lecture Notes in Computer Science 2719, pages 767-775. Springer-Verlag, juin 2003.
|
[JL04] | David Janin et
Giacommo Lenzi.
On the Relationship Between Monadic and Weak Monadic
Second Order Logic on Arbitrary Trees.
Fundamenta Informaticae 61(3-4):247-265. IOS Press, 2004.
|
[JLM97] | Birgit Jenner,
Klaus-Jörn Lange et
Pierre McKenzie.
Tree Isomorphism and Some Other Complete Problems
for Deterministic Logspace.
Technical Report 1059, DIRO, Université de Montréal, Canada, mars 1997.
|
[JLR13] | Line Juhl, Kim Guldstrand Larsen et Jean-François Raskin. Optimal Bounds for Multiweighted and Parametrised Energy Games. In Theories of Programming and Formal Methods – Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 8051, pages 244-255. Springer-Verlag, 2013. |
[JLR15] | Aleksandra Jovanović, Didier Lime et Olivier H. Roux. Integer Parameter Synthesis for Timed Automata. IEEE Transactions on Software Engineering 41(5):445-461. IEEE Comp. Soc. Press, mai 2015. |
[JLS07] | Marcin Jurdziński, François Laroussinie et Jeremy Sproston. Model Checking Probabilistic Timed Automata with One or Two Clocks. In TACAS'07, Lecture Notes in Computer Science 4424, pages 170-184. Springer-Verlag, mars 2007. |
[JLS12] | Kenneth Yrke Jørgensen, Kim Guldstrand Larsen et Jiří Srba. Time-Darts: A Data Structure for Verification of Closed Timed Automata. In SSV'12, Electronic Proceedings in Theoretical Computer Science 102, pages 141-155. Novembre 2012. |
[JLS15] | Marcin Jurdziński, Ranko Lazić et Sylvain Schmitz. Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. In ICALP'15, Lecture Notes in Computer Science 9135, pages 260-272. Springer-Verlag, juillet 2015. |
[JLS+13] | Jonas Finnemann Jensen, Kim Guldstrand Larsen, Jiří Srba et Lars Kærlund Østergaard. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In SPIN'13, Lecture Notes in Computer Science 7976, pages 178-195. Springer-Verlag, juillet 2013. |
[JLS+14] | Peter Gjøl Jensen, Kim Guldstrand Larsen, Jiří Srba, Mathias Grund Sørensen et Jakob Haar Taankvist. Memory Efficient Data Structures for Explicit Verification of Timed Systems. In NFM'14, Lecture Notes in Computer Science 8430, pages 307-312. Springer-Verlag, avril 2014. |
[JMM+20] | Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi et Ocan Sankur. Incremental methods for checking real-time consistency. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 249-264. Springer-Verlag, septembre 2020. |
[JMO07] | Jacques Julliand, Hassan Mountassir et Émilie Oudot. VeSTA: A Tool to Verify the Correct Integration of a Component in a Composite Timed System. In ICFEM'07, Lecture Notes in Computer Science 4789, pages 116-135. Springer-Verlag, novembre 2007. |
[JMR+03] | Thierry Jéron,
Hervé Marchand,
Vlad Rusu et
Valéry Tschaen.
Ensuring the Conformance of Reactive Discrete-Event
Systems using Supervisory Control.
In CDC'03,
pages 2692- 2697.
IEEE Comp. Soc. Press, décembre 2003.
|
[Joh83] | David S. Johnson.
TheNP-Completeness Column: An Ongoing Guide.
Journal of Algorithms 4(4):397-411. Elsevier, décembre 1983.
|
[Joh90] | David S. Johnson.
A Catalog of Complexity Classes.
In Jan van Leeuwen (eds.),
Handbook of Theoretical Computer Science.
Elsevier, 1990.
|
[Joh03] | Jan Johannsen.
Satisfiability Problems Complete for Deterministic
Logarithmic Space.
In STACS'04,
Lecture Notes in Computer Science 2996, pages 317-325. Springer-Verlag, mars 2003.
|
[JR11] | Rémi Jaubert et
Pierre-Alain Reynier.
Quantitative Robustness Analysis of Flat Timed
Automata.
In FoSSaCS'11,
Lecture Notes in Computer Science 6604, pages 229-244. Springer-Verlag, mars 2011.
|
[JRL+07] | Jan J. Jensen,
Jacob Illum Rasmussen,
Kim Guldstrand Larsen et
Alexandre David.
Guided Controller Synthesis for Climate Controller
Using UPPAAL Tiga.
In FORMATS'07,
Lecture Notes in Computer Science 4763, pages 227-240. Springer-Verlag, octobre 2007.
|
[JS07] | Petr Jančar et
Zdeněk Sawa.
A note on Emptiness for Alternating Finite Automata
with a One-letter Alphabet.
Information Processing Letters 104(5):164-167. Elsevier, novembre 2007.
|
[JT98] | Birgit Jenner et
Jacobo Torán.
The Complexity of Obtaining Solutions for Problems
in NP and NL.
In Lane A. Hemaspaandra et
Alan L. Selman (eds.),
Complexity Theory Retrospective II.
Springer-Verlag, 1998.
|
[Jur98] | Marcin Jurdziński.
Deciding the Winner in Parity Games is in
UP∩co-UP.
Information Processing Letters 68(3):119-124. Elsevier, novembre 1998.
|
[Jur00] | Marcin Jurdziński.
Small Progress Measures for Solving Parity Games.
In STACS'00,
Lecture Notes in Computer Science 1770, pages 290-301. Springer-Verlag, mars 2000.
|
[JW95] | David Janin et
Igor Walukiewicz.
Automata for the Modal μ-Calculus and
Related Results.
In MFCS'95,
Lecture Notes in Computer Science 969, pages 552-562. Springer-Verlag, août 1995.
|
[JW96] | David Janin et
Igor Walukiewicz.
On the Expressive Completeness of the Propositional
Mu-Calculus With Respect to Monadic Second Order
Logic.
In CONCUR'96,
Lecture Notes in Computer Science 1119, pages 263-277. Springer-Verlag, août 1996.
|
[JW18] | Paulin Jacquot et Cheng Wan. Routing game on parallel networks: the convergence of atomic to nonatomic. In CDC'18, pages 6951-6956. IEEE Comp. Soc. Press, décembre 2018. |
Sélectionner
37 correspondances trouvéesListe des auteurs
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 6
- 1
- 1
- 3
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 5
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 1