Sciweavers

Share
FUIN
2007
79views more  FUIN 2007»
9 years 2 days ago
An Interpretation of Robinson Arithmetic in its Grzegorczyk's Weaker Variant
Q− is a weaker variant of Robinson arithmetic Q in which addition and multiplication are partial functions, i.e. ternary relations that are graphs of possibly non-total function...
Vítezslav Svejdar
FUIN
2007
110views more  FUIN 2007»
9 years 2 days ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor
FUIN
2007
95views more  FUIN 2007»
9 years 2 days ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
FUIN
2007
93views more  FUIN 2007»
9 years 2 days ago
Davis-Putnam Style Rules for Deciding Property S
Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e = ∅, for all e ∈ E and f ⊆ σ, for all f ...
Robert Cowen, Adam Kolany
FUIN
2007
123views more  FUIN 2007»
9 years 2 days 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
FUIN
2007
108views more  FUIN 2007»
9 years 2 days 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
138views more  FUIN 2007»
9 years 2 days ago
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
Roman R. Redziejowski
FUIN
2007
94views more  FUIN 2007»
9 years 2 days ago
Algorithm of Translation of MSC-specified System into Petri Net
We present in this paper the algorithm which performs the translation of MSC’2000 diagrams into Petri net modulo strong bisimulation. The correctness of this algorithm is justifi...
Sergiy Kryvyy, Lyudmila Matvyeyeva
FUIN
2007
104views more  FUIN 2007»
9 years 2 days 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
books