Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Guy Vidal-Naquet"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 59, Iss Proc. ICE 2011, Pp 69-83 (2011)
This paper presents an investigation of the notion of reaction time in some synchronous systems. A state-based description of such systems is given, and the reaction time of such systems under some classic composition primitives is studied. Reaction
Externí odkaz:
https://doaj.org/article/fc4c481b51c244748d913cd30f4a6d8e
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 38, Iss Proc. ICE 2010, Pp 83-98 (2010)
We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be aperiodic, and are
Externí odkaz:
https://doaj.org/article/f7798e14173a453cb6e3a5ebdea5f260
Autor:
Nacéra Bennacer, Guy Vidal-Naquet
Publikováno v:
International Journal of Systems and Service-Oriented Engineering
International Journal of Systems and Service-Oriented Engineering, 2012, 3 (1), pp.58-72. ⟨10.4018/jssoe.2012010104⟩
International Journal of Systems and Service-Oriented Engineering, 2012, 3 (1), pp.58-72. ⟨10.4018/jssoe.2012010104⟩
International audience; This paper proposes an Ontology-driven and Community-based Web Services (OCWS) framework which aims at automating discovery, composition and execution of web services. The purpose is to validate and to execute a user's request
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67c67a12465a1731cf19028a817f077d
https://hal-supelec.archives-ouvertes.fr/hal-00677514
https://hal-supelec.archives-ouvertes.fr/hal-00677514
Publikováno v:
Journal Européen des Systèmes Automatisés (JESA)
Journal Européen des Systèmes Automatisés (JESA), 2011, 45 (1-3), pp.93-108. ⟨10.3166/jesa.45.93-108⟩
Journal Européen des Systèmes Automatisés (JESA), Lavoisier, 2011, 45 (1-3), pp.93-108. ⟨10.3166/jesa.45.93-108⟩
Journal Européen des Systèmes Automatisés (JESA), 2011, 45 (1-3), pp.93-108. ⟨10.3166/jesa.45.93-108⟩
Journal Européen des Systèmes Automatisés (JESA), Lavoisier, 2011, 45 (1-3), pp.93-108. ⟨10.3166/jesa.45.93-108⟩
National audience; Cet article présente une étude du délai de séparabilité dans certains systèmes synchrones. La séparabilité correspond à l'observation d'une dépendance fonctionnelle entre une sortie et une entrée. Une description de ces
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51875978a62eb904f14d9e6a9d4ffe4f
https://centralesupelec.hal.science/hal-00650089
https://centralesupelec.hal.science/hal-00650089
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 59, Iss Proc. ICE 2011, Pp 69-83 (2011)
ICE
ICE
This paper presents an investigation of the notion of reaction time in some synchronous systems. A state-based description of such systems is given, and the reaction time of such systems under some classic composition primitives is studied. Reaction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f84ca3174bfe5689461d2d0ab8e5a271
Publikováno v:
Proceeding of 1st Workshop on Critical Automotive applications : Robustness & Safety 2010 (CARS)
1st Workshop on Critical Automotive applications : Robustness & Safety 2010 (CARS)
1st Workshop on Critical Automotive applications : Robustness & Safety 2010 (CARS), Apr 2010, Valencia, Spain. pp.71-74
EDCC-CARS
1st Workshop on Critical Automotive applications : Robustness & Safety 2010 (CARS)
1st Workshop on Critical Automotive applications : Robustness & Safety 2010 (CARS), Apr 2010, Valencia, Spain. pp.71-74
EDCC-CARS
ISBN 978-1-60558-915-2; International audience; We present a new approach of validation for critical real- time applications: the tree based approach. This approach explicitly takes the conditional statements and the semantics contained in the tests
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ab60a7905bb918f8f85498c5bf02bd7
https://hal-supelec.archives-ouvertes.fr/hal-00488261
https://hal-supelec.archives-ouvertes.fr/hal-00488261
Publikováno v:
Proceedings of ICE 2010 3rd Interaction and Concurrency Experience
ICE 2010 3rd Interaction and Concurrency Experience
ICE 2010 3rd Interaction and Concurrency Experience, Jun 2010, Amsterdam, Netherlands. pp.83-98
ICE
Electronic Proceedings in Theoretical Computer Science, Vol 38, Iss Proc. ICE 2010, Pp 83-98 (2010)
ICE 2010 3rd Interaction and Concurrency Experience
ICE 2010 3rd Interaction and Concurrency Experience, Jun 2010, Amsterdam, Netherlands. pp.83-98
ICE
Electronic Proceedings in Theoretical Computer Science, Vol 38, Iss Proc. ICE 2010, Pp 83-98 (2010)
We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be aperiodic, and are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8d1325e486492f3655c2acecd37b8f8
Publikováno v:
SEW
In order to take semantical aspects into account for the scheduling problem and obtain scheduling results for a wide class of systems, we extend the Petri net scheduling approach for real-time systems. Our study focuses on tasks with conditional stat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb4b3f8bbc3d20417062bbf4402e2697
https://doi.org/10.1109/sew.2009.16
https://doi.org/10.1109/sew.2009.16
Publikováno v:
Proceedings of the 2nd Workshop on Isolation and Integration in Embedded Systems
IIES 2009
IIES 2009, Mar 2009, Nuremburg, Germany. 6 p
IIES 2009
IIES 2009, Mar 2009, Nuremburg, Germany. 6 p
ISBN:978-1-60558-464-5; International audience; Sharing resources between multiple untrusted clients requires a shared service that provides access to the resources upon client requests. But executing these requests needs other resources, like memory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1e4f8b639718a550025ebe6a035911e
https://hal-supelec.archives-ouvertes.fr/hal-00471460
https://hal-supelec.archives-ouvertes.fr/hal-00471460
Publikováno v:
IEEE Real-Time and Embedded Technology and Applications Symposium
Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium
14th IEEE Real-Time and Embedded Technology and Applications Symposium
14th IEEE Real-Time and Embedded Technology and Applications Symposium, Apr 2008, Saint Louis, United States. pp.237-247
Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium
14th IEEE Real-Time and Embedded Technology and Applications Symposium
14th IEEE Real-Time and Embedded Technology and Applications Symposium, Apr 2008, Saint Louis, United States. pp.237-247
International audience; Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into ac- count. This paper presents new schedule representations in order to overcome these difficulties, by allowing p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bb8e71a10d1c0e9f1727185721745e9
https://doi.org/10.1109/rtas.2008.17
https://doi.org/10.1109/rtas.2008.17