Satisfiability of temporal logics with concrete domain

Vortrag von Claudia Carapelle

Veranstaltungsort: APB 3027
Beginn: 25. Mai 2016 um 14:50
Ende: 25. Mai 2016 um 15:50
Forschungsgruppe: Automatentheorie
Event series: KBS Seminar
iCal

We show how we can enrich linear- and branching-time temporal logics with the ability to talk about data words and data trees, where the data values are taken from a "concrete domain" D. We consider the satisfiability problem for such logics, and identify sufficient conditions on D to guarantee decidability.