Sciweavers

254 search results - page 45 / 51
» Restarting Tree Automata
Sort
View
ACOM
2006
Springer
14 years 1 months ago
Temporal Logics for Representing Agent Communication Protocols
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
Ulle Endriss
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 12 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
13 years 11 months ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
13 years 11 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan