Sciweavers

311 search results - page 16 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
TCS
2002
13 years 8 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
ISMIS
2003
Springer
14 years 1 months ago
A Formal Approach to Describing Action Concepts in Taxonomical Knowledge Bases
T his paper outlines a formal theory for de fining action concepts in taxonomical knowledge representation languages, in a form closely related to description logics. The central p...
Christel Kemke
ICALP
2004
Springer
14 years 2 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 6 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ENTCS
2006
231views more  ENTCS 2006»
13 years 8 months ago
SaveCCM: An Analysable Component Model for Real-Time Systems
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...
Jan Carlson, John Håkansson, Paul Pettersson