Early Verification of Computer Systems Temporal Properties

Authors:
Paulo Sérgio Muniz Silva
Affiliations:
Departamento de Engenharia de Computação e Sistemas Digitais, Escola Politécnica da Universidade de São Paulo, Av. Prof. Luciano Gualberto, trav. 3, n.158 05508-900 São Pa ...
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 16
Cited 0

Introduction to algorithms

Introduction to algorithms
Exact and approximate reasoning about temporal relations

Computational Intelligence
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Reasoning about qualitative temporal information

Artificial Intelligence - Special volume on constraint-based reasoning
On binary constraint problems

Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
Operational semantics for MSC'96

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on advanced topics on SDL and MSC
Concurrency: state models & Java programs

Concurrency: state models & Java programs
Inference of message sequence charts

Proceedings of the 22nd international conference on Software engineering
Maintaining knowledge about temporal intervals

Communications of the ACM
MESA: Support for Scenario-Based Design of Concurrent Systems

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Early Fault Detection Tools

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Analyser for Mesage Sequence Charts

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Extended Message Sequence Charts With Time-Interval Semantics

TIME '98 Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning
Eight maximal tractable subclasses of Allen's algebra with metric time

Journal of Artificial Intelligence Research
Integrating metric and qualitative temporal reasoning

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In early moments of computer systems development, computer engineers typically draw interaction diagrams, occasionally annotated with timing constraints, to reason about the specification of the system behavior. One of the most popular of these diagrams is the Message Sequence Chart (MSC). However, not always does the intended behavior described by MSCs correspond to their actual behavior. To help the formal verification of their actual behavior, i.e. their temporal properties, this paper describes an interpretation of basic timed MSCs in a temporal framework that formally represents, in a unified model, both the qualitative and the metric temporal information conveyed in these intuitive diagrams. The framework solves the verification problems in polynomial time and lays the foundation of an automatic tool.