The use of temporal logic in the compositional specification of concurrent systems
Temporal logics and their applications
Structuring theories on consequence
Lecture notes in Computer Science on Recent trends in data type specification
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Applications of deontic logic in computer science: a concise overview
Deontic logic in computer science
A Tableaux System for Deontic Action Logic
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
Putting theories together to make specifications
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Encapsulating deontic and branching time specifications
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we investigate formal mechanisms to allow designers to decompose specifications (stated in a given logic) into several components. The basic ideas come from [1] where some notions from category theory are used to put together logical specifications. In this setting the concept of locality allows designers to write separate specifications and then compose them. However, as the work of Fiadeiro and Maibaum [1] is stated in a linear temporal logic, we investigate how to extend these notions to a branching time logic, which can be used to specify systems where non-determinism is a relevant mechanism. Since we are interested in specifying and verifying fault-tolerant systems, we also introduce deontic operators in our logic, we have shown in [2] that deontic logic allows us to express notions such as ideal and abnormal behavior which are closely related to fault-tolerance.