Article

TTET: Event-Triggered Channels on a Time-Triggered Base

Authors:

ICECCS '04: Proceedings of the Ninth IEEE International Conference on Engineering Complex Computer Systems Navigating Complexity in the e-Engineering Age

Pages 39 - 46

Published: 14 April 2004 Publication History

Publisher Site

Abstract

This paper develops solutions for efficient transfer ofsporadic (event-triggered) data over a time-triggered communicationchannel. We present novel and efficient techniquesfor composite provisioning of the event triggered(ET) and time triggered (TT) paradigms to achieve both thepredictability and .exibility inherent in TT and ET systemsrespectively. As a tangible demonstration of the techniques,present and assess a variation of the TTP/C protocol, whereminor operational changes allow for its efficient handling ofsporadic message traffic.

Cited By

View all

Freier MChen J(2016)Sporadic Task Handling in Time-Triggered SystemsProceedings of the 19th International Workshop on Software and Compilers for Embedded Systems10.1145/2906363.2906383(135-144)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2906363.2906383
Mundhenk PSagstetter FSteinhorst SLukasiewycz MChakraborty SMarculescu RNicolescu G(2014)Policy-based message scheduling using FlexRayProceedings of the 2014 International Conference on Hardware/Software Codesign and System Synthesis10.1145/2656075.2656094(1-10)Online publication date: 12-Oct-2014
https://dl.acm.org/doi/10.1145/2656075.2656094

Index Terms

TTET: Event-Triggered Channels on a Time-Triggered Base
1. Networks
  1. Network protocols
    1. Network protocol design
    2. Protocol correctness
      1. Protocol testing and verification

Recommendations

Maliciously Secure MPC From Semi-Honest 2PC in the Server-Aided Model
Secure multi-party computation (MPC) provides provable security guarantees for many privacy critical applications. The semi-honest MPC protocols are secure against semi-honest adversaries who can only observe the protocol execution, while the maliciously ...
Protocols for Multiparty Coin Toss with a Dishonest Majority

Coin-tossing protocols are protocols that generate a random bit with uniform distribution, although some corrupted parties might try to bias the output. These protocols are used as a building block in many cryptographic protocols. Cleve (Proc. of the ...
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985

An $$\alpha $$α-fair coin-tossing protocol allows a set of mutually distrustful parties to generate a uniform bit, such that no efficient adversary can bias the output bit by more than $$\alpha $$α. Cleve [STOC 1986] has shown that if half of the ...

Comments

Information & Contributors

Information

Published In

ICECCS '04: Proceedings of the Ninth IEEE International Conference on Engineering Complex Computer Systems Navigating Complexity in the e-Engineering Age

April 2004

235 pages

ISBN:0769521096

Publisher

IEEE Computer Society

United States

Publication History

Published: 14 April 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Freier MChen J(2016)Sporadic Task Handling in Time-Triggered SystemsProceedings of the 19th International Workshop on Software and Compilers for Embedded Systems10.1145/2906363.2906383(135-144)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2906363.2906383
Mundhenk PSagstetter FSteinhorst SLukasiewycz MChakraborty SMarculescu RNicolescu G(2014)Policy-based message scheduling using FlexRayProceedings of the 2014 International Conference on Hardware/Software Codesign and System Synthesis10.1145/2656075.2656094(1-10)Online publication date: 12-Oct-2014
https://dl.acm.org/doi/10.1145/2656075.2656094

Abstract

Cited By

Index Terms

Recommendations

Maliciously Secure MPC From Semi-Honest 2PC in the Server-Aided Model

Protocols for Multiparty Coin Toss with a Dishonest Majority

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations