@inproceedings{bebcd79220ef46c5a507c66fa8c8ec19,
title = "Temporally Faithful Execution of Business Transactions",
abstract = "Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurrent transactions corresponds to \{\textbackslash{}em some\} serial execution of the same transactions. Many important business applications, however, require the system to impose a partial serialization order between transactions pinned to a specific point in time and conventional transactions that attempt to commit before, at, or after that point in time. This paper introduces \{\textbackslash{}em temporal faithfulness\} as a new correctness criterion for such cases. Temporal faithfulness does not require real-time capabilities but ensures that the serialization order of a set of business transactions is not in conflict with precedence requirements between them. The paper also shows how a temporally faithful transaction scheduler can be built by extending proven scheduling techniques.",
author = "Werner Obermair and Michael Schrefl",
year = "2000",
month = jun,
language = "English",
isbn = "9783540676300",
volume = "1789",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "462--481",
editor = "Benkt Wangler and Lars Bergman",
booktitle = "Proceedings of the 12th International Conference on Advanced Information Systems Engineering, June 5-9, 2000, Stockholm, Schweden",
}