Sciweavers

13 search results - page 1 / 3
» Compositional State Space Reduction Using Untangled Actions
Sort
View
ENTCS
2007
111views more  ENTCS 2007»
13 years 3 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
ESEC
1997
Springer
13 years 7 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
FLAIRS
2004
13 years 5 months ago
State Space Reduction For Hierarchical Reinforcement Learning
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
Mehran Asadi, Manfred Huber
ENTCS
2010
127views more  ENTCS 2010»
13 years 3 months ago
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchical-structured component-oriented software systems. However, the rule...
Markus Lumpe
ASE
2004
167views more  ASE 2004»
13 years 3 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen