|
Summary: Overview overview4
Introduction
Modelling parallel systems
Linear Time Properties
Regular Properties
Linear Temporal Logic
Computation-Tree Logic
Equivalences and Abstraction
1 / 569
Regular LT properties lf2.6-regular
2 / 569
Regular LT properties lf2.6-regular
Idea: define regular LT properties to be those
languages of infinite words over the alphabet 2AP2AP
2AP
that have a representation by a finite automata
3 / 569
Regular LT properties lf2.6-regular
Idea: define regular LT properties to be those
languages of infinite words over the alphabet 2AP2AP
|
