Name
Abstract | ||
|---|---|---|
Existing approaches for the verification of normative systems consider limited representations of norms, often neglecting collective imperatives, deadlines and contrary-to-duty obligations. In order to capture the requirements of real-world scenarios, these structures are important. In this paper we propose methods for the specification and formal verification of complex normative systems that include contrary-to-duty, collective and event-driven imperatives with deadlines. We propose an operational syntax and semantics for the specification of such systems. Using Maude and its linear temporal logic model checker, we show how important properties can be verified for such systems, and provide some experimental results for both bounded and unbounded verification. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-42691-4_8 | COIN@AAMAS/IJCAI |
Keywords | Field | DocType |
Model checking,Normative systems,Collective imperatives | Complex system,Model checking,Normative,Computer science,Theoretical computer science,Linear temporal logic,Syntax,Semantics,Bounded function,Formal verification | Conference |
Volume | Citations | PageRank |
9628 | 0 | 0.34 |
References | Authors | |
17 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Gasparini | 1 | 4 | 2.08 |
| Timothy J. Norman | 2 | 1417 | 140.04 |
| Martin J. Kollingbaum | 3 | 390 | 33.38 |
| Liang Chen | 4 | 116 | 7.56 |
| John-Jules Ch. Meyer | 5 | 2316 | 286.04 |