Sciweavers

12289 search results - page 790 / 2458
» computing 2006
Sort
View
FUIN
2007
133views more  FUIN 2007»
15 years 7 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
FUIN
2007
100views more  FUIN 2007»
15 years 7 months ago
Interpreted Nets
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
Ludwik Czaja
186
Voted
FUIN
2007
104views more  FUIN 2007»
15 years 7 months ago
Modelling and Checking Timed Authentication of Security Protocols
In this paper we offer a novel methodology for verifying correctness of (timed) security protocols. The idea consists in computing the time of a correct execution of a session and ...
Gizela Jakubowska, Wojciech Penczek
FUIN
2007
108views more  FUIN 2007»
15 years 7 months ago
Local Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
Antoni W. Mazurkiewicz
FUIN
2007
123views more  FUIN 2007»
15 years 7 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc