![]()
AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name. |
|||||||
STUDIA INFORMATICA - Issue no. 1 / 2009 | |||||||
Article: |
PROVING THE DECIDABILITY OF THE PDL×PDL PRODUCT LOGIC. Authors: LÁSZLÓ ASZALÓS, PHILIPPE BALBIANI. |
||||||
Abstract: The propositional dynamic logic (PDL) is an adequate tool to write down programs. In a previous article we used PDL to formulate cryptographic protocols as parallel programs. In these protocols at least two agents/individuals exchange messages, so we needed to use product logic to formulate the parallel actions. Ágnes Kurucz proved that S5×S5×S5 – which is the simplest triple product logic – is undecidable, hence it follows that PDL×PDL×PDL is undecidable, too. It is easy to show that the PDL logic (without the star operator) is decidable, so it is an interesting problem, that the PDL×PDL product logic is decidable or not. Key words and phrases. Mathematical logic, Decidability, PDL×PDL product logic, Formal verification. |
|||||||
![]() |
|||||||