Sciweavers

81 search results - page 11 / 17
» A Formalisation of Finite Automata Using Hereditarily Finite...
Sort
View
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 9 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
78
Voted
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
15 years 1 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...
ICDAR
1995
IEEE
15 years 1 months ago
Efficient analysis of complex diagrams using constraint-based parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
Robert P. Futrelle, Nikos Nikolakis
76
Voted
LOGCOM
2007
115views more  LOGCOM 2007»
14 years 9 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
SIS
2007
14 years 11 months ago
A General Approach to Securely Querying XML
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
Ernesto Damiani, Majirus Fansi, Alban Gabillon, St...