We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed tec...
详细信息
ISBN:
(纸本)9781581136838
We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of coordination in multi-agent systems.
Improved bounds for the crossing number of the mesh of trees graph , M n , are derived. In particular, we derive a new lower bound of which improves on the previous bound of Leighton [11] by a constant factor, and an ...
详细信息
Improved bounds for the crossing number of the mesh of trees graph , M n , are derived. In particular, we derive a new lower bound of which improves on the previous bound of Leighton [11] by a constant factor, and an upper bound of . In addition, we construct drawings of M n which achieve the upper bound number of crossings. We also prove that the crossing number of M 4 is 4.
The paper presents a new tool for automated verification of Timed Automata as well as protocols written in the specification language Estelle. The current version offers an automatic translation from Estelle specifica...
详细信息
A convex drawing of an n-vertex graph G = (V,E) is a drawing in which the vertices are placed on the corners of a convex n-gon in the plane and each edge is drawn using one straight line segment. We derive a general l...
详细信息
A fuzzy software reliability model is proposed where the time intervals between the software failures are taken as the fuzzy variables governed by a membership function. The model takes into account the following assu...
详细信息
A fuzzy software reliability model is proposed where the time intervals between the software failures are taken as the fuzzy variables governed by a membership function. The model takes into account the following assumptions: new faults may be introduced into the software during debugging processes, the number of faults removed after a failure may be greater than one, and there is a growth of human experience during debugging. The model can be considered as an extension of the model developed by Cai, Wen and Zhang. An efficient algorithm is presented for estimating parameters of the model. The numerical examples validate the proposed model.
A multi-valued version of CTL* (mv-CTL*), where both the propositions and the accessibility relation are multi-valued taking values in a finite quasi-boolean algebra, is considered. A general translation from mv-CTL* ...
详细信息
Bounded Model Checking (BMC) based on SAT methods consists in searching for a counterexample of a particular length and to generate a propositional formula that is satisfiable iff such a counterexample exists. Our pap...
详细信息
The wavelength problem and the problem of arc (edge) congestion for communicating permutation instances on all-optical rings was studied. The best possible upper bounds on the number of wavelengths and arc (edge) cong...
详细信息
The wavelength problem and the problem of arc (edge) congestion for communicating permutation instances on all-optical rings was studied. The best possible upper bounds on the number of wavelengths and arc (edge) congestion in both the directed and undirected cases were obtained. Use of all-optical networks allowed higher transmission rates since there was no overhead due to conversions to and from electronic form during transmission.
An approach to service description and composition is presented. It is based on agent technology, and on the idea of separating description and composition language from biding, i.e., from specification of data format...
详细信息
An approach to service description and composition is presented. It is based on agent technology, and on the idea of separating description and composition language from biding, i.e., from specification of data format (exchanged by applications) and transport protocol. Usually, the biding is an integral part of description language, e.g., WSDL, and DAML-S. Starting with this idea, a simple service description language is constructed as well as a composition protocol is specified. Agents play crucial role in our approach; they are responsible for service composition.
暂无评论