Sciweavers

512 search results - page 84 / 103
» Automata as Abstractions
Sort
View
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...
BPM
2008
Springer
122views Business» more  BPM 2008»
13 years 9 months ago
Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance
Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defe...
Niels Lohmann
ICGI
2010
Springer
13 years 8 months ago
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
Herman Stehouwer, Menno van Zaanen
ALGORITHMICA
2006
97views more  ALGORITHMICA 2006»
13 years 7 months ago
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
Roberto Maria Avanzi, Clemens Heuberger, Helmut Pr...
FAC
2007
122views more  FAC 2007»
13 years 7 months ago
Formal techniques for performance analysis: blending SAN and PEPA
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...
Jane Hillston, Leïla Kloul