The computational complexity of scenario-based agent verification and design

Résultats de recherche: Contribution à un journal/une revueArticle

langue originaleAnglais
Pages (de - à)252-276
Nombre de pages25
journalJournal of Applied Logic
Volume5
Numéro de publication2
étatPublié - 2007

Citer ceci

@article{a8fc5863c96342cf8fedab2180021e48,
title = "The computational complexity of scenario-based agent verification and design",
author = "Yves Bontemps and Pierre-Yves Schobbens",
year = "2007",
language = "English",
volume = "5",
pages = "252--276",
journal = "Journal of Applied Logic",
issn = "1570-8683",
publisher = "Elsevier",
number = "2",

}

The computational complexity of scenario-based agent verification and design. / Bontemps, Yves; Schobbens, Pierre-Yves.

Dans: Journal of Applied Logic, Vol 5, Numéro 2, 2007, p. 252-276.

Résultats de recherche: Contribution à un journal/une revueArticle

TY - JOUR

T1 - The computational complexity of scenario-based agent verification and design

AU - Bontemps, Yves

AU - Schobbens, Pierre-Yves

PY - 2007

Y1 - 2007

M3 - Article

VL - 5

SP - 252

EP - 276

JO - Journal of Applied Logic

JF - Journal of Applied Logic

SN - 1570-8683

IS - 2

ER -