An Introduction to Time-Constrained Automata
| Autor: | Christophe Aussaguès, Guy Vidal-Naquet, Vincent David, Matthieu Lemerre |
|---|---|
| Přispěvatelé: | Faivre, Evelyne, Laboratoire des fondements des Systèmes Temps-Réels Embarqués (LASTRE), Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Supélec Sciences des Systèmes (E3S), Ecole Supérieure d'Electricité - SUPELEC (FRANCE), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)) |
| Rok vydání: | 2010 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Theoretical computer science Time constrained Semantics (computer science) Computer science Formal Languages and Automata Theory (cs.FL) Operating Systems (cs.OS) Computation Computer Science - Formal Languages and Automata Theory ComputerApplications_COMPUTERSINOTHERSYSTEMS 0102 computer and information sciences 02 engineering and technology 01 natural sciences lcsh:QA75.5-76.95 Scheduling (computing) Computer Science - Operating Systems Computer Science - Software Engineering 0202 electrical engineering electronic engineering information engineering Computer Science::Operating Systems lcsh:Mathematics 020207 software engineering lcsh:QA1-939 Determinism Automaton Logic in Computer Science (cs.LO) Software Engineering (cs.SE) 010201 computation theory & mathematics Aperiodic graph [INFO.INFO-OS] Computer Science [cs]/Operating Systems [cs.OS] Graph (abstract data type) lcsh:Electronic computers. Computer science [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS] |
| Zdroj: | 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) |
| DOI: | 10.48550/arxiv.1010.5571 |
| Popis: | 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 selected dynamically following a graph, the time-constrained automaton. This allows expressing much more precise time constraints than classical periodic or sporadic model, while preserving the ease of scheduling and analysis. We provide some properties of this model as well as their scheduling semantics. We show that TCA can be automatically derived from source-code, and optimally scheduled on single processors using a variant of EDF. We explain how time constraints can be used to guarantee communication determinism by construction, and to study when possible agent interactions happen. Comment: In Proceedings ICE 2010, arXiv:1010.5308 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|