Sciweavers

223 search results - page 40 / 45
» Synchronization of Pushdown Automata
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...
FORMATS
2008
Springer
13 years 9 months ago
Formal Modeling and Scheduling of Datapaths of Digital Document Printers
Abstract. We apply three different modeling frameworks -- timed automata (Uppaal), colored Petri nets and synchronous data flow -- to model a challenging industrial case study that...
Georgeta Igna, Venkatesh Kannan, Yang Yang, Twan B...
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
ENTCS
2007
97views more  ENTCS 2007»
13 years 7 months ago
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
Harald Fecher, Heiko Schmidt
COMCOM
2000
82views more  COMCOM 2000»
13 years 7 months ago
Experience with RT-LOTOS, a temporal extension of the LOTOS formal description technique
This paper is devoted to the presentation of the RT-LOTOS formal description technique, which is a formalism suited for applications where concurrency, complex synchronization pat...
Jean-Pierre Courtiat, C. A. S. Santos, Christophe ...