Wyniki wyszukiwania - BazTech

1

Bednarczyk M. A., Haas E., Kluk P., Kitowski Z., Konefał Sz., Neumann J., Pawłowski W., Pilecki J., Przybyszewska-Chudzik A.

Polish Hyperbaric Research

|

2012

|

nr 3(40)

185-206

PL

W pracy przedstawiono modularny system sterowania i symulacji dla łodzi autonomicznych ASVCaSP (ang. Autonomous Surface Vehicle Control and Simulation Platform). W zależności od konfiguracji pozwala on na autonomiczne sterowanie łodzią, wspomaga planowanie i przeprowadzanie misji, umożliwia prowadzenie szkoleń oraz oferuje środowisko symulacyjne na potrzeby oceny algorytmow autonomicznego sterowania.

EN

The article presents control and simulation system modules for autonomous boats: ASVCaSP (Autonomous Surface Vehicle Control and Simulation Platform). Depending on the configuration, the system allows autonomous vehicle control, supports mission planning and execution, facilitates the conducting of trainings and offers a simulated environment with the purpose of evaluation of autonomous control algorithms.

2

A Multi-facet Approach to Dynamic Agent Systems

Bednarczyk M.A., Pawłowski A., Bernardinello L., Pomello L., Borzyszkowski T.

Fundamenta Informaticae

|

2008

|

Vol. 85, nr 1-4

19-33

EN

We are concerned with the problem of defining a complex, hybrid, agent based discrete system in a modular way. The modularity results from looking at the system from a number of different perspectives, each dealing with a specific aspect of the system. As a solution a synchronization operator is proposed which glues agent aware systems on shared agents and transitions. The construction turns out to be a categorical product. We also show that a logic to talk about the temporal and the structural properties of the product can be obtained by gluing suitable logical frameworks from the components.

3

Limits of Modularity

Bednarczyk M.A.

Fundamenta Informaticae

|

2006

|

Vol. 74, nr 2,3

167-187

EN

It has been observed that various synchronisation operators underlying the modular design of concurrent systems can be explained as pullbacks in suitable categories of concurrent systems. Here, the boundaries of such approach are investigated. For this purpose we study the issue of completeness in categories of trace monoids. It turns out that (finite) completeness is achieved if trace monoids with concurrency preserving homomorphisms are considered. Taking arbitrary monoid homomorphisms leads, in general, to incompleteness. The results obtained are used to reveal an area in which the code problem for trace monoids, undecidable in general, has always a positive answer.

4

Expressing and Verifying Temporal and Structural Properties of Mobile Agents

Bednarczyk M.A., Jamroga W., Pawłowski W.

Fundamenta Informaticae

|

2006

|

Vol. 72, nr 1-3

51-63

EN

Logics for expressing properties of Petri hypernets, a visual formalism for modelling mobile agents, are proposed. Two classes of properties are of interest-the temporal evolution of agents and their structural correlation. In particular, we investigate how the classes can be combined into a logic capable of expressing the dynamic evolution of the structural correlation. The problem of model checking properties of a class of the logic on Petri hypernets is shown to be pspace-complete.

5

Finite completeness of categories of Petri nets

Bednarczyk M.A., Borzyszkowski A.M., Somla R.

Fundamenta Informaticae

|

2000

|

Vol. 43, Nr 1-4

21-48

EN

The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equaliz-ers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. The main positive result of the paper states that reachable Petri nets with multiplica-tive morphisms form a finitely complete category. As an application of this result, some well-known categories are shown to be finitely complete. For instance, since all morphisms between reachable safe Petri nets are multiplicative, it follows that the category of reachable safe Petri nets is finitely complete.