1 / 3

MATL: Language

MATL: Language. To each view a we associate the smallest CTL language containing: a finite set of Propositional Atoms P a the set BA a = { B X f | f is a formula of a B X } , that is the Belief Atoms of the form B X f for each formula f of view a B X. MATL: Language.

myron
Download Presentation

MATL: Language

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MATL: Language To each view a we associate the smallestCTL language containing: • a finite set of Propositional Atoms Pa • the set BAa= {BXf| fis a formula of aBX}, that is the Belief Atoms of the form BXf for each formula f of view aBX

  2. MATL: Language To each view a we associate the smallestCTL language containing: • a finite set of Propositional Atoms Pa • the set BAa= {BXf| fis a formula of aBX}, that is the Belief Atoms of the form BXf for each formula f of view aBX Example AG(BABBP)is a formula of viewe

  3. MATL: Language Definition: Given a family{Pa}of sets of propositional atoms, the family ofMATL languages on Pais the family of CTL languages{La} A MATL formulafbelonging toLa is denoted by a : f Example e :AG(BABBP)denotes the formulaAG(BABBP)of view e

More Related