Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Overview overview6.3 Introduction
 

Summary: Overview overview6.3
Introduction
Modelling parallel systems
Linear Time Properties
Regular Properties
Linear Temporal Logic (LTL)
Computation Tree Logic
syntax and semantics of CTL
expressiveness of CTL and LTL
CTL model checking ---
fairness, counterexamples/witnesses
CTL+++
and CTL
Equivalences and Abstraction
1 / 454
CTL model checking ctlmc4.3-1
given: finite TS T = (S, Act, , S0, AP, L)T = (S, Act, , S0, AP, L)T = (S, Act, , S0, AP, L)
CTL formula over APAPAP
question: does T |= T |= T |= hold ?
2 / 454

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences