The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The time-triggered architecture
Abstract
The time-triggered architecture (TTA) provides a computing infrastructure for the design and implementation of dependable distributed embedded systems. A large real-time application is decomposed into nearly autonomous clusters and nodes, and a fault-tolerant global time base of known precision is generated at every node. In the TTA, this global time is used to precisely specify the interfaces among the nodes, to simplify the communication and agreement protocols, to perform prompt error detection, and to guarantee the timeliness of real-time applications. The TTA supports a two-phased design methodology, architecture design, and component design. During the architecture design phase, the interactions among the distributed components and the interfaces of the components are fully specified in the value domain and in the temporal domain. In the succeeding component implementation phase, the components are built, taking these interface specifications as constraints. This two-phased design methodology is a prerequisite for the composability of applications implemented in the TTA and for the reuse of prevalidated components within the TTA. This paper presents the architecture model of the TTA, explains the design rationale, discusses the time-triggered communication protocols TTP/C and TTP/A, and illustrates how transparent fault tolerance can be implemented in the TTA.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Real-time systems: Design principles for distributed embedded applications
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)90277-7 · Cited by 1,865
The N-Version Approach to Fault-Tolerant Software
Avizienis, A. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.231893 · Cited by 1,049
The Sciences of the Artificial
Simon, H. A. (2019) · The MIT Press eBooks · doi:10.7551/mitpress/12107.001.0001 · Cited by 982
Dependability: Basic Concepts and Terminology
Laprie, J. C. (1992) · Dependable Computing and Fault-Tolerant Systems · doi:10.1007/978-3-7091-9170-5_1 · Cited by 745
Why Do Computers Stop and What Can Be Done About It?
Gray, J. (2024) · doi:10.6084/m9.figshare.27043420 · Cited by 663
Clock Synchronization in Distributed Real-Time Systems
Kopetz, H., & Ochsenreiter, W. (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.5009516 · Cited by 572
Self-citationSIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
The design philosophy of the DARPA Internet Protocols
Clark, D. D. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205458 · Cited by 396
FTMP—A highly reliable fault-tolerant multiprocess for aircraft
Hopkins, A. L., Smith, T. B., & Lala, J. H. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11113 · Cited by 370
Dependability: Basic Concepts and Terminology
Laprie, J.-C. (1992) · Dependable computing and fault-tolerant systems · doi:10.1007/978-3-7091-9170-5 · Cited by 282
(1989) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0042462 · Cited by 279
An upper and lower bound for clock synchronization
Lundelius, J., & Lynch, N. (1984) · Information and Control · doi:10.1016/s0019-9958(84)80033-9 · Cited by 250
Architectural principles for safety-critical real-time applications
Lala, J. H., & Harper, R. E. (1994) · Proceedings of the IEEE · doi:10.1109/5.259424 · Cited by 234
What's ahead for embedded software?
Lee, E. A. (2000) · Computer · doi:10.1109/2.868693 · Cited by 230
The MAFT architecture for distributed fault tolerance
Keichafer, R. M., Walter, C. J., Finn, A. M., & Thambidurai, P. M. (1988) · IEEE Transactions on Computers · doi:10.1109/12.2183 · Cited by 198
Bus Architectures for Safety-Critical Embedded Systems
Rushby, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45449-7_22 · Cited by 158
A Comparison of Bus Architectures for Safety-Critical Embedded Systems
Rushby, J. (2003) · Cited by 136
The time-triggered model of computation
Kopetz, H. (2002) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1998.739743 · Cited by 128
Self-citationThe non-blocking write protocol NBW: A solution to a real-time synchronization problem
Kopetz, H., & Reisinger, J. (2002) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1993.393507 · Cited by 122
Self-citationTemporal uncertainties in interactions among real-time objects
Kopetz, H., & Kim, K. H. (2002) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1990.93962 · Cited by 113
Self-citationSystematic formal verification for fault-tolerant time-triggered algorithms
Rushby, J. (1999) · IEEE Transactions on Software Engineering · doi:10.1109/32.815324 · Cited by 101
Hardware and software fault tolerance: a unified architectural approach
Lala, J. H., & Alger, L. (2003) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcs.1988.5326 · Cited by 79
Formal verification for time-triggered clock synchronization
Pfeifer, H., Schwier, D., & von Henke, F. W. (2003) · doi:10.1109/dcfts.1999.814297 · Cited by 60
Embedded Software — An Agenda for Research
Lee, E. A. (1999) · Cited by 44
Tolerating Arbitrary Node Failures in the Time-Triggered Architecture
Kopetz, H., Bauer, G., & Poledna, S. (2001) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2001-01-0677 · Cited by 31
Self-citation
Cited by
Bibliographical review on reconfigurable fault-tolerant control systems
Zhang, Y., & Jiang, J. (2008) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2008.03.008 · Cited by 2,652
The Past, Present and Future of Cyber-Physical Systems: A Focus on Models
Lee, E. (2015) · Sensors · doi:10.3390/s150304837 · Cited by 682
A Perspective on IEEE Time-Sensitive Networking for Industrial Communication and Automation Systems
Lo Bello, L., & Steiner, W. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2905334 · Cited by 367
Toward a Science of Cyber–Physical System Integration
Sztipanovits, J., Koutsoukos, X., Karsai, G., Kottenstette, N., Antsaklis, P., Gupta, V., Goodwine, B., Baras, J., & Wang, S. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2161529 · Cited by 327
Lee, E. A. (2010) · Proceedings of the 47th Design Automation Conference · doi:10.1145/1837274.1837462 · Cited by 315
Metadata
- Authors
- Kopetz, H., & Bauer, G.
- Venue
- Proceedings of the IEEE
- Published
- 2003-01
- Volume
- 91
- Issue
- 1
- Pages
- 112-126
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2119699246
- Cited by
- 859
- References
- 27
- FWCI
- 62.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.