Sciweavers

581 search results - page 5 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
FORMATS
2007
Springer
14 years 1 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
EUROMICRO
2007
IEEE
13 years 11 months ago
Analysis of BPEL Data Dependencies
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
Yongyan Zheng, Jiong Zhou, Paul Krause
LICS
2010
IEEE
13 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
CAV
2004
Springer
152views Hardware» more  CAV 2004»
14 years 3 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
SSPR
2000
Springer
14 years 1 months ago
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
Mikel L. Forcada, Rafael C. Carrasco