Sciweavers

1357 search results - page 27 / 272
» Compositional analysis for linear systems
Sort
View
ENTCS
2007
111views more  ENTCS 2007»
13 years 10 months ago
Compositional State Space Reduction Using Untangled Actions
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a f...
Xu Wang, Marta Z. Kwiatkowska
ICFP
2002
ACM
14 years 10 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 10 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
CONCUR
1994
Springer
14 years 2 months ago
Weak Sequential Composition in Process Algebras
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
Arend Rensink, Heike Wehrheim
ECRTS
2007
IEEE
14 years 4 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher