Sciweavers

769 search results - page 100 / 154
» Simple Composition of Nets
Sort
View
HYBRID
2000
Springer
14 years 1 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
FPCA
1995
14 years 1 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
14 years 1 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
LREC
2008
147views Education» more  LREC 2008»
13 years 11 months ago
Word Segmentation of Vietnamese Texts: a Comparison of Approaches
We present in this paper a comparison between three segmentation systems for the Vietnamese language. Indeed, the majority of Vietnamese words is built by semantic composition fro...
Quang Thang Dinh, Hong Phuong Le, Thi Minh Huyen N...
SDL
2007
171views Hardware» more  SDL 2007»
13 years 11 months ago
Model Driven Development and Code Generation: An Automotive Case Study
Describing an application as a simple composition of services allows advanced features that exploit different platforms to be conceived e formalized at a high abstraction level. S...
Michele Banci, Alessandro Fantechi, Stefania Gnesi...