D. Peled and W. Penczek. Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems, Proc. of PSTV'95, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....set method [22 26] and the sleep set method [8, 14, 16] are state search techniques that are based on the idea that when two executions of action sequences are sufficiently similar to each other, it is not necessary to investigate both of the executions. Persistent sets [8, 9] and ample sets [16 18] are strikingly similar to stubborn sets, at least if we consider the actual construction algorithms that have been suggested for stubborn, persistent and ample sets. This similarity is made explicit in [13] where a set is said to be a stamper set whenever the set is stubborn or ample or ....

Peled, D., and Penczek, W.: Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems. In [3], pp. 115--130.

....28, 30, 31, 38, 49, 55, 99, 100] are state search techniques that are based on the idea that when two executions of action sequences are sufficiently similar to each other, it is not necessary to investigate both of the executions. Persistent sets [25, 26, 29, 31, 38, 98, 99, 100] and ample sets [51, 55, 56, 57] are strikingly similar to stubborn sets, at least if we consider the actual construction algorithms that have been suggested for stubborn, persistent and ample sets. This similarity is made explicit in [48] where a set is said to be a stamper set whenever the set is stubborn or ample or ....

....When definitions are as they should be, stubbornness implies dynamic stubbornness but not vice versa. Chapter 4 shows that in place transition nets, persistence (as defined in the persistent set method) and conditional stubbornness [29] are special forms of dynamic stubbornness. Ample sets [51, 55, 56, 57] are considered, too. The concepts of ampleness and dynamic stubbornness have much in common though ampleness is strongly oriented towards verification with fairness assumptions. 5 1.4 Verification of linear time temporal properties Chapter 5 is concentrated on the verification of ....

[Article contains additional citation context not shown here]

Peled, D., and Penczek, W.: Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems. In [17], pp. 115--130.

.... it has allowed to develop an adequate theory of Petri nets (cf. P 77] Maz 77] Wi 80] Wi 82] GR 86] DMM 89] for example) From the other side, it has allowed to reduce dramatically the computational complexity of practical analysis of concurrent systems (cf. GW 91] GK 91] Pe 93] PP 95] for example) The core of this idea is that all possible processes of a concurrent system are represented as partially ordered sets of executions of actions, or occurrences of state components, or both, where the lack of order between elements represents their causal independence. In [DMM 89] ....

Peled, D., Penczek, W., Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems, Proc. of PSTV'95 Conf. on Protocol Specification, Testing, and Verification, Warsaw, June 1995, pp.305-321

.... firstly, in the future, we want to define a BDI logic interpreted over structures of partial order runs and asynchronous automata are acceptors of these runs, and secondly, it is known that using partial order semantics allows for efficient verification by applying partial order reduction methods [12]. 2 Intuition behind the formalism A multi agent system (MAS, for short) is modeled as an asynchronous automaton composed of the synchronizing agents. Each agent can be viewed as a non deterministic automaton having its states and actions. Agents can execute individual or joint actions. A joint ....

....the rationalizable runs. Finite representation of rationalizable runs gives rise to the method of verifying that the problem of existence of rationalizable runs satisfying certain properties is decidable in our framework. This corresponds to checking a non emptiness of asynchronous automata, see [12]. As far as comparison of our formalism with the existing frameworks is concerned, our model of rational BDI agents is the first one based on asynchronous automata. The model is so close to the reality that it can be almost directly implemented after specifying the states and actions of the ....

[Article contains additional citation context not shown here]

D. Peled and W. Penczek. Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems, Proc. of PSTV'95, 1995.

....of concurrent and distributed systems such as telecommunication protocols. The stubborn set method [20, 21, 22, 23, 24, 25] is one of the methods that try to relieve the state space explosion problem that occurs in state space generation. Somewhat similar techniques have been presented in e.g. [3, 5, 6, 7, 10, 12, 13, 14, 15, 16]. Using [21] it is easy to derive a non brute force algorithm that finds a stubborn set that contains the least number of enabled transitions. The point of this paper is that though the obtained minimization algorithm is not practical as such, an incomplete version of the algorithm can be quite ....

Peled D, Penczek W: Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems. In [17].

....notions play crucial role in the theory of Distributed Systems (DS) Multi agent Systems (MAS) and Games (G) respectively, and although come from different fields, they are related to each other. Asynchronous automata [47] AA, for short) are frequently used as models of distributed systems [31]. Executions of AA corresponding to system behaviours can be defined as sequences of states as well as partial orders [11] Therefore, the main advantage of AA over standard finite automata relies on the explicit representation of concurrency in system execution rather than modelling it by ....

D. Peled and W. Penczek. Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems, Proc. of PSTV'95, pp. 115--130, 1995.

No context found.

D. Peled and W. Penczek. Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems, Proc. of PSTV'95, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC