Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/138181| Title: | Conflict analysis for timed contract automata |
| Other Titles: | Legal knowledge and information systems |
| Authors: | Azzopardi, Shaun Pace, Gordon J. |
| Keywords: | Machine theory Deontic logic Logic, Symbolic and mathematical Contracts -- Data processing Computer algorithms |
| Issue Date: | 2024 |
| Publisher: | IOS Press |
| Citation: | Azzopardi, S., & Pace, G. J. (2024). Conflict Analysis for Timed Contract Automata. In J. Savelka, J. Harasta, T. Novotna, & J. Misek (Eds.), Legal Knowledge and Information Systems (pp. 250-255). Netherland: IOS Press. |
| Abstract: | One can find various temporal deontic logics in literature, most focusing on discrete time. The literature on real-time constraints and deontic norms is much sparser. Thus, many analysis techniques which have been developed for deontic logics have not been considered for continuous time. In this paper we focus on the notion of conflict analysis which has been extensively studied for discrete time deontic logics. We present a sound, but not complete algorithm for detecting conflicts in timed contract automata and prove the correctness of the algorithm, illustrating the analysis on a case study. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/138181 |
| Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Conflict_analysis_for_timed_contract_automata(2024).pdf | 227.94 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.