Back to Search
Start Over
Paraconsistent Transition Systems
- Source :
- EPTCS 376, 2023, pp. 3-15
- Publication Year :
- 2023
-
Abstract
- Often in Software Engineering, a modeling formalism has to support scenarios of inconsistency in which several requirements either reinforce or contradict each other. Paraconsistent transition systems are proposed in this paper as one such formalism: states evolve through two accessibility relations capturing weighted evidence of a transition or its absence, respectively. Their weights come from a specific residuated lattice. A category of these systems, and the corresponding algebra, is defined as providing a formal setting to model different application scenarios. One of them, dealing with the effect of quantum decoherence in quantum programs, is used for illustration purposes.<br />Comment: In Proceedings LSFA 2022, arXiv:2303.12680
- Subjects :
- Computer Science - Logic in Computer Science
Subjects
Details
- Database :
- arXiv
- Journal :
- EPTCS 376, 2023, pp. 3-15
- Publication Type :
- Report
- Accession number :
- edsarx.2303.13254
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.4204/EPTCS.376.3