DeepAI AI Chat
Log In Sign Up

Paraconsistent Transition Systems

03/23/2023
by   Ana Cruz, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/14/2022

A Logic for Paraconsistent Transition Systems

Modelling complex information systems often entails the need for dealing...
10/20/2020

A canonical algebra of open transition systems

Feedback and state are closely interrelated concepts. Categories with fe...
06/17/2021

Quantum Software Development Lifecycle

With recent advances in the development of more powerful quantum compute...
07/04/2019

Injective envelopes of transition systems and Ferrers languages

We consider reflexive and involutive transition systems over an ordered ...
05/05/2022

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy

The "Sum-Over-Paths" formalism is a way to symbolically manipulate linea...
10/02/2017

The SysML/KAOS Domain Modeling Approach

A means of building safe critical systems consists of formally modeling ...