Improving Translation of Live Sequence Charts to Temporal Logic

Abstract

An efficient and mathematically rigorous translation from Live Sequence Charts (LSCs) to temporal logic is essential to providing an end-to-end specification and verification method for System on Chip (SoC) protocols. Without mathematical rigor, no translation can be trusted to completely represent the LSC specification, while inefficiency renders even provably sound translations useless in verifying the correctness of industrial-strength protocols. Previous work shows that the LSC-to-temporal logic and LSC-to-automata translations can be automated and formalized for the LSC language. In the LSC-to-temporal logic translation, the extraordinary size of the resulting formula limits the scalability of the charts that can be translated and verified. Our work, on the other hand, leverages intuitive temporal logic reductions to generate a formula that is at most quadratic in the size of the chart and demonstrates the benefits of the improved translation on several examples.

Monitor petri nets for security monitoring

“…Kumar et al transform protocols described as LSCs in temporal logic [9]. As the transformation to temporal logic leads to an explosion of the temporal logic formula, it is not usable for our approach.…”

“…As an alternative to his approach, Solhaug recommends taking a closer look at LSCs, which can be utilized to capture deontic constraints in the model. Following this idea, Kumar et al [9] use LSCs for the specification and verification of protocols, because LSCs are more expressive and semantically richer than MSCs or SDs.…”

“…Last but not least, an execution semantic is needed where transitions fire whenever possible (9) and where many concurrently running communication instances can be manipulated efficiently (10). To the best of our knowledge, all existing PN-based approaches that are used for the specification of security monitors violate at least one or more of the requirements mentioned above.…”

Semantic Studies of a Synchronous Approach to Activity Recognition

“…Model checking of LSCs is possible by translating them into temporal logic, but the size of the resulting formula, even for simple LSCs, makes it difficult. However, [16] proposes a more efficient translation, but only for a class of LSCs.…”

Behaviour modelling and transformations for context-aware mobile applications

“…Further work on LSCs semantics can be found in [120][121], in which mappings of LSCs onto temporal logic are presented. Also behaviour correctness scores high, due to the extensive support for behaviour analysis of LCSs proposed in [115,122].…”