Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Combinatorics on traces
Theoretical Computer Science
Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
Journal of the ACM (JACM)
The Book of Traces
Deciding LTL over Mazurkiewicz traces
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
On Model Checking Synchronised Hardware Circuits
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Modeling Real-Time Systems-Challenges and Work Directions
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Formally Specifying and Verifying Real-Time Systems
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
The Temporal Logic of Programs
The Temporal Logic of Programs
Model Checking Real-Time Component Based Systems with Blackbox Testing
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Extension of Mazukiewicz Traces and their Applications in Specification of Real-Time Systems
KSE '10 Proceedings of the 2010 Second International Conference on Knowledge and Systems Engineering
Hi-index | 0.00 |
This paper proposes a method for specification and verification of distributed real-time systems using timed traces. The key idea of the proposed method is to extend distributed transition systems and linear temporal logic over Foata configurations with time. We show that systems are easily specified and verified with this method. The system behaviors are specified by a distributed duration transition system and the system properties are specified by a formula of our proposed timed logic over timed traces. We give an algorithm for solving the verification problem automatically. We also give an example to illustrate how our algorithm work.