The Experts below are selected from a list of 315 Experts worldwide ranked by ideXlab platform

Wenhui Zhang - One of the best experts on this subject based on the ideXlab platform.

  • proving Liveness Property under strengthened compassion requirements
    Theory and Applications of Models of Computation, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving Liveness properties under strengthened compassion is presented, and proofs of the soundness and the relative completeness of the rule are also presented.

  • Proving Liveness Property under Fairness Requirements
    2012 19th Asia-Pacific Software Engineering Conference, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Different rules for proving properties have been studied for systems with different kinds of fairness constraints, such as justice, compassion and strengthened compassion. This work considers a kind of bounded fairness and propose a general form that includes these fairness constraints. The general form is referred to as mixed-fairness (m-fairness for short). A deductive rule for proving live ness properties under m-fairness is presented with examples illustrating the application of the deductive rule.

  • APSEC - Proving Liveness Property under Fairness Requirements
    2012 19th Asia-Pacific Software Engineering Conference, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Different rules for proving properties have been studied for systems with different kinds of fairness constraints, such as justice, compassion and strengthened compassion. This work considers a kind of bounded fairness and propose a general form that includes these fairness constraints. The general form is referred to as mixed-fairness (m-fairness for short). A deductive rule for proving live ness properties under m-fairness is presented with examples illustrating the application of the deductive rule.

  • TAMC - Proving Liveness Property under strengthened compassion requirements
    Lecture Notes in Computer Science, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving Liveness properties under strengthened compassion is presented, and proofs of the soundness and the relative completeness of the rule are also presented.

Teng Long - One of the best experts on this subject based on the ideXlab platform.

  • proving Liveness Property under strengthened compassion requirements
    Theory and Applications of Models of Computation, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving Liveness properties under strengthened compassion is presented, and proofs of the soundness and the relative completeness of the rule are also presented.

  • Proving Liveness Property under Fairness Requirements
    2012 19th Asia-Pacific Software Engineering Conference, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Different rules for proving properties have been studied for systems with different kinds of fairness constraints, such as justice, compassion and strengthened compassion. This work considers a kind of bounded fairness and propose a general form that includes these fairness constraints. The general form is referred to as mixed-fairness (m-fairness for short). A deductive rule for proving live ness properties under m-fairness is presented with examples illustrating the application of the deductive rule.

  • APSEC - Proving Liveness Property under Fairness Requirements
    2012 19th Asia-Pacific Software Engineering Conference, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Different rules for proving properties have been studied for systems with different kinds of fairness constraints, such as justice, compassion and strengthened compassion. This work considers a kind of bounded fairness and propose a general form that includes these fairness constraints. The general form is referred to as mixed-fairness (m-fairness for short). A deductive rule for proving live ness properties under m-fairness is presented with examples illustrating the application of the deductive rule.

  • TAMC - Proving Liveness Property under strengthened compassion requirements
    Lecture Notes in Computer Science, 2012
    Co-Authors: Teng Long, Wenhui Zhang
    Abstract:

    Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving Liveness properties under strengthened compassion is presented, and proofs of the soundness and the relative completeness of the rule are also presented.

Jerzy Brzezinski - One of the best experts on this subject based on the ideXlab platform.

  • reliable broadcast protocol independent of system parameters for ad hoc networks with Liveness Property
    Ad-Hoc Mobile and Wireless Networks, 2012
    Co-Authors: Jerzy Brzezinski, Michal Kalewski, Cezary Sobaniec
    Abstract:

    The MANET Liveness Property ensures that any partition in an ad hoc network is not permanently isolated. For networks that fulfil the Property a few crash-tolerant broadcast protocols have been proposed. However, it has also been proved that the minimum time of direct connectivity between nodes, and thus the correctness of the protocols, depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each node concurrently. In this paper, we propose an improved version of the reliable broadcast protocols that works correctly, even though the minimum time of direct connection between nodes allows them to exchange (send and respond to) at least only two messages, making the correctness of this protocol independent of system parameters.

  • ADHOC-NOW - Reliable broadcast protocol independent of system parameters for ad hoc networks with Liveness Property
    Ad-hoc Mobile and Wireless Networks, 2012
    Co-Authors: Jerzy Brzezinski, Michal Kalewski, Cezary Sobaniec
    Abstract:

    The MANET Liveness Property ensures that any partition in an ad hoc network is not permanently isolated. For networks that fulfil the Property a few crash-tolerant broadcast protocols have been proposed. However, it has also been proved that the minimum time of direct connectivity between nodes, and thus the correctness of the protocols, depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each node concurrently. In this paper, we propose an improved version of the reliable broadcast protocols that works correctly, even though the minimum time of direct connection between nodes allows them to exchange (send and respond to) at least only two messages, making the correctness of this protocol independent of system parameters.

  • PPAM (1) - On time constraints of reliable broadcast protocols for ad hoc networks with the Liveness Property
    Parallel Processing and Applied Mathematics, 2012
    Co-Authors: Jerzy Brzezinski, Michal Kalewski, Dariusz Wawrzyniak
    Abstract:

    In this paper we consider a formal model of ad hoc systems and its Liveness Property, defined with the use of the concept of dynamic sets. In this context we analyse reliable broadcast protocols dedicated for use in this kind of networks. In solutions proposed till now it is assumed that the minimum time of direct connectivity between any neighbouring nodes is much longer than maximum message transmission time. This assumption covers, however, dependence of the required minimum time of direct communication on some system parameters. Therefore, in this paper we show precisely how the minimum time of direct connectivity depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each node concurrently.

  • SRDS - Providing Uniform Reliable Broadcast Delivery for Mobile Ad Hoc Networks with MANET Liveness Property
    2012 IEEE 31st Symposium on Reliable Distributed Systems, 2012
    Co-Authors: Jerzy Brzezinski, Michal Kalewski, Jacek Kobusiński
    Abstract:

    The MANET Liveness Property ensures that no operative host in an ad hoc network is permanently isolated, and for networks that fulfill the Property a few crash-tolerant broadcast protocols have been proposed. However, the protocols proposed till now guarantee that only at least an arbitrary majority of operative hosts receives each disseminated message, and one of these protocols has been further modified to fulfill the properties of regular reliable broadcast. Moreover, it has also been proved that the minimum time of direct connectivity between hosts, and thus the correctness of all these protocols, depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each host concurrently. In this paper, we propose a novel uniform reliable broadcast protocol that works correctly, even though the minimum time of a direct connection between hosts allows them to exchange at least only two messages, which makes the correctness of this protocol independent of the total number of messages that can be disseminated by all nodes in a network.

  • on time constraints of reliable broadcast protocols for ad hoc networks with the Liveness Property
    Parallel Processing and Applied Mathematics, 2011
    Co-Authors: Jerzy Brzezinski, Michal Kalewski, Dariusz Wawrzyniak
    Abstract:

    In this paper we consider a formal model of ad hoc systems and its Liveness Property, defined with the use of the concept of dynamic sets. In this context we analyse reliable broadcast protocols dedicated for use in this kind of networks. In solutions proposed till now it is assumed that the minimum time of direct connectivity between any neighbouring nodes is much longer than maximum message transmission time. This assumption covers, however, dependence of the required minimum time of direct communication on some system parameters. Therefore, in this paper we show precisely how the minimum time of direct connectivity depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each node concurrently.

Rebekah Carter - One of the best experts on this subject based on the ideXlab platform.

  • Verification of Liveness properties on hybrid dynamical systems
    2013
    Co-Authors: Rebekah Carter
    Abstract:

    A hybrid dynamical system is a mathematical model for a part of the real world where discrete and continuous parts interact with each other. Typically such systems are complex, and it is difficult to know how they will behave for general parameters and initial conditions. However, the method of formal verification gives us the ability to prove automatically that certain behaviour does or does not happen for a range of parameters in a system. The challenge is then to define suitable methods for proving properties on hybrid systems.This thesis looks at using formal verification for proving Liveness properties on hybrid systems: a Liveness Property says that something good eventually happens in the system. This work presents the theoretical background and practical application of various methods for proving and disproving inevitability properties (a type of Liveness) in different classes of hybrid systems. The methods combine knowledge of dynamical behaviour of a system with the brute-force approach of model checking, in order to make the most of the benefits of both sides. The work on proving Liveness properties is based on abstraction of dynamical systems to timed automata. This thesis explores the limits of a pre-defined abstraction method, adds some dynamical knowledge to the method, and shows that this improvement makes Liveness properties provable in certain continuous dynamical systems. The limits are then pushed further to see how this method can be used for piecewise-continuous dynamical systems. The resulting algorithms are implemented for both classes of systems.In order to disprove Liveness properties in hybrid systems a novel framework is proposed, using a new Property called deadness. Deadness is a dynamically-aware Property of the hybrid system which, if true, disproves the Liveness Property by means of a finite execution: we usually require an infinite execution to disprove a Liveness Property. An algorithm is proposed which uses dynamical properties of hybrid systems to derive deadness properties automatically, and the implementation of this algorithm is discussed and applied to a simplified model of an oilwell drillstring.

  • dynamically driven timed automaton abstractions for proving Liveness of continuous systems
    Formal Modeling and Analysis of Timed Systems, 2012
    Co-Authors: Rebekah Carter, Eva M Navarrolopez
    Abstract:

    We look at the problem of proving inevitability of continuous dynamical systems. An inevitability Property says that a region of the state space will eventually be reached: this is a type of Liveness Property from the computer science viewpoint, and is related to attractivity of sets in dynamical systems. We consider a method of Maler and Batt to make an abstraction of a continuous dynamical system to a timed automaton, and show that a potentially infinite number of splits will be made if the splitting of the state space is made arbitrarily. To solve this problem, we define a method which creates a finite-sized timed automaton abstraction for a class of linear dynamical systems, and show that this timed abstraction proves inevitability.

  • FORMATS - Dynamically-Driven timed automaton abstractions for proving Liveness of continuous systems
    Lecture Notes in Computer Science, 2012
    Co-Authors: Rebekah Carter, Eva M. Navarro-lópez
    Abstract:

    We look at the problem of proving inevitability of continuous dynamical systems. An inevitability Property says that a region of the state space will eventually be reached: this is a type of Liveness Property from the computer science viewpoint, and is related to attractivity of sets in dynamical systems. We consider a method of Maler and Batt to make an abstraction of a continuous dynamical system to a timed automaton, and show that a potentially infinite number of splits will be made if the splitting of the state space is made arbitrarily. To solve this problem, we define a method which creates a finite-sized timed automaton abstraction for a class of linear dynamical systems, and show that this timed abstraction proves inevitability.

Jacek Kobusiński - One of the best experts on this subject based on the ideXlab platform.

  • SRDS - Providing Uniform Reliable Broadcast Delivery for Mobile Ad Hoc Networks with MANET Liveness Property
    2012 IEEE 31st Symposium on Reliable Distributed Systems, 2012
    Co-Authors: Jerzy Brzezinski, Michal Kalewski, Jacek Kobusiński
    Abstract:

    The MANET Liveness Property ensures that no operative host in an ad hoc network is permanently isolated, and for networks that fulfill the Property a few crash-tolerant broadcast protocols have been proposed. However, the protocols proposed till now guarantee that only at least an arbitrary majority of operative hosts receives each disseminated message, and one of these protocols has been further modified to fulfill the properties of regular reliable broadcast. Moreover, it has also been proved that the minimum time of direct connectivity between hosts, and thus the correctness of all these protocols, depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each host concurrently. In this paper, we propose a novel uniform reliable broadcast protocol that works correctly, even though the minimum time of a direct connection between hosts allows them to exchange at least only two messages, which makes the correctness of this protocol independent of the total number of messages that can be disseminated by all nodes in a network.