---

Computing with Idiotypic Networks

@inproceedings{martins.slani:idiotypic-networks,
  author      = {Francisco Martins and
                 Neva Slani},
  title       = {Computing with Idiotypic Networks},
  booktitle   = {Proceedings the International IIS: IIPWM'05 Conference held in Gdansk, Poland, June 13-16, 2005},
  series      = {Advances in Soft Computing},

  OPTvolume   = {},
  OPTpages    = {},
  publisher   = {Springer},
  year        = {2005},
  note        = {}.
}

Abstract

The main result of the paper is an application of the model inspired by immune system, i.e. by it's computiational aspect, on The Museum Problem. The problem is defined within the artificial intelligence, as one example of artificial vision problem; the goal is to teach artificial agents to distinguish deviant behaviour from the usual one and that way protect proper material (pieces of an art exhibition) from the foreign bodies (bad behaved visitors). The model we developed has shown to be well-suited to address one whole class of problems known to be NP-complete.

---

Modeli apstraktne kriptografije i protokoli

@MastersThesis{slani:masters-thesis,
  author       = {Neva Slani},
  title        = {Modeli apstraktne kriptografije i protokoli},
  school       = {University of Zagreb}, 
  year         = {2004},
  month        = jul
}

Sazetak

U radu su predstavljena tri apstraktna modela kriptografskih protokola: model transformacija multiskupova, model niti i model struna. Svaki od tih modela detaljno je opisan. Pokazana je eksplicitna veza modela transformacija multiskupova i modela niti. Model struna koristi termine i sintakticke elemente prva dva modela. Iako neformalan, namece se zakljuak o njihovoj medusobnoj korespondenciji. Modeli su istog nivoa apstrakcije i uspijeva ju modelirati jednaka svojstva protokola, jedino se mehanizmi rasudivanja o tim svojstvima razlikuju.

Abstract

We present three different abstract models for cryptography protocols: multiset rewriting model, strand spaces model, cord spaces model. Each one of those models is exposed in detail, with explicit link between multiset rewriting and strands given. Cords use terminology and syntactic elements of the other two models. Therefore strong and intuitive, although informal, conclusion about mutual correspondence of all models. Models are of the same abstraction level, modelling the same protocol properties, only the mechanisms for reasoning about those properties differ.

---

Privacy, Abstract Encryption and Protocols: An ASM Model - Part I

@inproceedings{rosenzweig.etal:privacy-encryption-protocols-asm,
  author       = {Dean Rosenzweig and Davor Runje and Neva Slani},
  title	       = {Privacy, Abstract Encryption and Protocols: An ASM Model - Part I},
  booktitle    = {Abstract State Machines 2003. Advances in Theory and Practice: 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003. Proceedings},
  volume       = {Volume 2589 of LNCS},
  pages	       = {372 --},
  publisher    = {Springer Berlin / Heidelberg},
  year         = {2003}.
} 

Abstract

We introduce an executable formal model of abstract encryption using the specification language AsmL, based on Abstract State Machines of Gurevich, providing a simple executable models for cryptographic protocols. We show strong universality properties of our descriptions of patterns, protocol roles and environment behaviors--no ASM program can do better, given the same information.

---

Typed Hybrid Multimodal Logic

Abstract

Some potential application domains of hybrid multimodal logic strongly suggest typing of states and imposing type-constraints on modalities. We investigate logical/computational cost of such an extension, and find out that, in the case of a very simple system of types, there is none: the extension essentially preserves both expressivity and complexity of hybrid multimodal logic. Use of types should be decided on pragmatic grounds. We also introduce a sound and strongly complete tableau calculus for the extended logic.