HASLab - Indexed Articles in Conferences

Permanent URI for this collection

http://localhost:4000/handle/123456789/176

Browse

Browsing HASLab - Indexed Articles in Conferences by Author "5620"
  • Item
    Behavioural and Abstractor Specifications for a Dynamic Logic with Binders and Silent Transitions
    ( 2019) Hennicker,R ; Mindt,F ; Alexandre Castro Madeira ; Knapp,A ; 5620
    We extend dynamic logic with binders (for state variables) by distinguishing between observable and silent transitions. This differentiation gives rise to two kinds of observational interpretations of the logic: abstractor and behavioural specifications. Abstractor specifications relax the standard model class semantics of a specification by considering its closure under weak bisimulation. Behavioural specifications, however, rely on a behavioural satisfaction relation which relaxes the interpretation of state variables and the satisfaction of modal formulas and by abstracting from silent transitions. A formal relation between abstractor and behavioural specifications is provided which shows that both coincide semantically under mild conditions. For the proof we instantiate the previously introduced concept of a behaviour-abstractor framework to the case of dynamic logic with binders and silent transitions. © 2020, Springer Nature Switzerland AG.
  • Item
    Behavioural and Abstractor Specifications for a Dynamic Logic with Binders and Silent Transitions
    ( 2019) Mindt,F ; 5620
    We extend dynamic logic with binders (for state variables) by distinguishing between observable and silent transitions. This differentiation gives rise to two kinds of observational interpretations of the logic: abstractor and behavioural specifications. Abstractor specifications relax the standard model class semantics of a specification by considering its closure under weak bisimulation. Behavioural specifications, however, rely on a behavioural satisfaction relation which relaxes the interpretation of state variables and the satisfaction of modal formulas and by abstracting from silent transitions. A formal relation between abstractor and behavioural specifications is provided which shows that both coincide semantically under mild conditions. For the proof we instantiate the previously introduced concept of a behaviour-abstractor framework to the case of dynamic logic with binders and silent transitions. © 2020, Springer Nature Switzerland AG.
  • Item
    Capturing Qubit Decoherence through Paraconsistent Transition Systems
    ( 2023) Alexandre Castro Madeira ; Luís Soares Barbosa ; 5620 ; 5603
    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. © 2023 Owner/Author.
  • Item
    A Fuzzy Modal Logic for Fuzzy Transition Systems
    ( 2020) Alexandre Castro Madeira ; Jain,M ; Martins,MA ; 5620
    This paper intends to contribute with a new fuzzy modal logic to model and reason about transition systems involving uncertainty in behaviours. Our formalism supports fuzziness at transitions and on the proposition symbols assignment levels. Against of other approaches in the literature, our bisimulation and bisimilarity notions generalise the analogous standard notions of classic modal logic and of process algebras. Moreover, the outcome of our logic is also fuzzy, with the semantic interpretation of connectives supported by the Godel algebra.
  • Item
    A Fuzzy Modal Logic for Fuzzy Transition Systems
    ( 2020) Alexandre Castro Madeira ; 5620
    This paper intends to contribute with a new fuzzy modal logic to model and reason about transition systems involving uncertainty in behaviours. Our formalism supports fuzziness at transitions and on the proposition symbols assignment levels. Against of other approaches in the literature, our bisimulation and bisimilarity notions generalise the analogous standard notions of classic modal logic and of process algebras. Moreover, the outcome of our logic is also fuzzy, with the semantic interpretation of connectives supported by the Godel algebra.
  • Item
    A Fuzzy Modal Logic for Fuzzy Transition Systems
    ( 2020) Jain,M ; 5620
    This paper intends to contribute with a new fuzzy modal logic to model and reason about transition systems involving uncertainty in behaviours. Our formalism supports fuzziness at transitions and on the proposition symbols assignment levels. Against of other approaches in the literature, our bisimulation and bisimilarity notions generalise the analogous standard notions of classic modal logic and of process algebras. Moreover, the outcome of our logic is also fuzzy, with the semantic interpretation of connectives supported by the Godel algebra.
  • Item
    A Logic for Paraconsistent Transition Systems
    ( 2022) Cruz,A ; Alexandre Castro Madeira ; Luís Soares Barbosa ; 5603 ; 5620
  • Item
    Logics for Petri Nets with Propagating Failures
    ( 2019) Alexandre Castro Madeira ; Leandro Rafael Gomes ; Benevides,M ; 6759 ; 5620
    Petri nets play a central role in the formal modelling of a wide range of complex systems and scenarios. Their ability to handle with both concurrency and resource awareness justifies their spread in the current formal development practices. On the logic side, Dynamic Logics are widely accepted as the de facto formalisms to reason about computational systems. However, as usual, the application to new situations raises new challenges and issues. The ubiquity of failures in the execution of current systems, interpreted in these models as triggered events that are not followed by the corresponding transition, entails not only the adjustment of these structures to deal with this reality, but also the introduction of new logics adequate to this emerging phenomenon. This paper contributes to this challenge by exploring a combination of two previous works of the authors, namely the Propositional Dynamic Logic for Petri Nets [1] and a parametric construction of multi-valued dynamic logics presented in [13]. This exercise results in a new family of Dynamic Logics for Petri Nets suitable to deal with firing failures. © 2019, IFIP International Federation for Information Processing.
  • Item
    On Kleene Algebras for Weighted Computation
    ( 2017) Leandro Rafael Gomes ; Alexandre Castro Madeira ; Luís Soares Barbosa ; 5620 ; 6759 ; 5603
  • Item
    Paraconsistent Transition Systems
    ( 2023) Luís Soares Barbosa ; Alexandre Castro Madeira ; 5603 ; 5620
    Often in Software Engineering a modelling 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 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.
  • Item
    Stepwise Development of Paraconsistent Processes
    ( 2023) Alexandre Castro Madeira ; Luís Soares Barbosa ; 5620 ; 5603
  • Item
    Structured Specification of Paraconsistent Transition Systems
    ( 2023) Luís Soares Barbosa ; Alexandre Castro Madeira ; 5603 ; 5620
    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. © 2023, IFIP International Federation for Information Processing.