Sciweavers

Share
FUIN
2007
100views more  FUIN 2007»
8 years 12 months ago
An Algebraic Characterization of the Halting Probability
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
Gregory J. Chaitin
FUIN
2007
100views more  FUIN 2007»
8 years 12 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
FUIN
2007
84views more  FUIN 2007»
8 years 12 months ago
Observation Based System Security
A formal model for description of passive and active timing attacks is presented, studied and compared with other security concepts. It is based on a timed process algebra and on a...
Damas P. Gruska
FUIN
2007
104views more  FUIN 2007»
8 years 12 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
FUIN
2007
91views more  FUIN 2007»
8 years 12 months ago
Verification of the TESLA protocol in MCMAS-X
Alessio Lomuscio, Franco Raimondi, Bozena Wozna
FUIN
2007
92views more  FUIN 2007»
8 years 12 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
FUIN
2007
74views more  FUIN 2007»
8 years 12 months ago
A Note on the Emptiness of Semigroup Intersections
We consider decidability questions for the emptiness problem of intersections of matrix semigroups. This problem was studied by A. Markov [7] and more recently by V. Halava and T....
Paul Bell
FUIN
2007
130views more  FUIN 2007»
8 years 12 months ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
FUIN
2007
116views more  FUIN 2007»
8 years 12 months ago
Decidability Problems of a Basic Class of Object Nets
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
Roxana Dietze, Manfred Kudlek, Olaf Kummer
FUIN
2007
116views more  FUIN 2007»
8 years 12 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
books