Home → Campus Koblenz → Fachbereich 4: Informatik → Wissenschaftliche Einrichtungen → Institut für Informatik → Arbeitsgruppe Steigner → Kolloquium (Institut Informatik) → Automatic Verification of Processes Using Formulas of an Interval Logic

Automatic Verification of Processes Using Formulas of an Interval Logic

Vortrag im Kolloquium Informatik von Prof. Dr. Manuel Capel Tunon, Universidad de Granada

Freitag, 10.03.2011, 16:00 c.t., Raum B 016

Referent: Prof. Dr. Manuel Capel-Tunon, Universidad de Granada

Gastgeber: Prof. Dr. Dieter Zöbel

     

Abstract:

Specification and verification of concurrent systems is difficult because reactive system executions are infinite --which is known as "state-explosion problem"; moreover there are a huge number of different possible executions for each system, because of the interleavings.

Propositional Temporal Logic (PTL) is a convenient formalism to specify properties of systems with a linear behaviour. Nevertheless: System designers have found PTL difficult to use, since, in many cases, formulas describing complex properties become very hard to understand. The lack of a graphical representation of PTL formulas is another drawback to get a widespread use of PTL.

With Interval-based temporal logics (FIL/GIL, CCTL, etc.) we can obtain a graphical finite representation of complex properties defined over infinite execution sequences.

As epitome of our presentation, several applications to business processes and telecommunication systems will be shown as a highly collaborative research field in which the University of Granada's group is very interested presently.

Prof. Dr. Manuel Capel-Tunon, Universidad de Granada

http://lsi.ugr.es/~mcapel/mcapel_en.html

What
  • Termin Fachbereich 4
  • Termin Campus Koblenz
  • Kolloquium Informatik
When Mar 10, 2011
from 04:15 PM to 06:00 PM
Where B 016
Contact Name Prof. Dr. Dieter Zöbel
Add event to calendar vCal
iCal