This paper sets the basis for a compositional and structured approach to the specification of paraconsistent transitions systems, framed as an institution. The latter and theirs logics were previously introduced in [CMB22] to deal with scenarios of inconsistency in which several requirements are on stake, either reinforcing or contradicting each other.
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 resi...
This position paper builds on the authors’ previous work on paraconsistent transition systems to propose a modelling framework for quantum circuits with explicit representation of decoherence.
This paper sets the basis for a compositional and structured approach to the specification of paraconsistent transitions systems, framed as an institution. The latter and theirs logics were previously introduced in [CMB22] to deal with scenarios of inconsistency in which several requirements are on stake, either reinforcing or contradicting each other.
This position paper builds on the authors’ previous work on paraconsistent transition systems to propose a modelling framework for quantum circuits with explicit representation of decoherence.
This book constitutes the thoroughly refereed post-conference proceedings of the 26th International Workshop on Algebraic Development Techniques, WADT 2022, held in Aveiro, Portugal, in June 2022. The 6 revised papers presented together with 2 invited papers were carefully reviewed and selected from 25 submissions. The contributed presentations covered a range of topics about the algebraic approach to system sp...
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 resi...
A wide range of methods from computer science are being applied to many modern engineering domains, such as synthetic biology. Most behaviors described in synthetic biology have a hybrid nature, in the sense that both discrete or continuous dynamics are observed. Differential Dynamic Logic (dL) is a well-known formalism used for the rigorous treatment of these systems by considering formalisms comprising both d...
The development of more flexible and robust models for reasoning about systems in environments with potentially conflicting information is becoming more and more relevant in different contexts. In this direction, we recently introduced paraconsistent transition systems, i.e. transition systems whose transitions are tagged with a pair of weights, one standing for the degree of evidence that the transition exists...
This paper explores a strict relation between two core notions of the semantics of programs and of fuzzy logics: Kleene Algebras and (pseudo) uninorms. It shows that every Kleene algebra induces a pseudo uninorm, and that some pseudo uninorms induce Kleene algebras. This connection establishes a new perspective on the theory of Kleene algebras and provides a way to build (new) Kleene algebras. The latter aspect...