Sciweavers

432 search results - page 21 / 87
» Interaction Abstraction for Compositional Finite State Syste...
Sort
View
JNS
2010
107views more  JNS 2010»
13 years 2 months ago
Ground States and Critical Points for Aubry-Mather Theory in Statistical Mechanics
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...
Rafael de La Llave, Enrico Valdinoci
ESEC
1997
Springer
13 years 11 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...
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 2 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
CONCUR
2007
Springer
13 years 11 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
IFM
2004
Springer
14 years 27 days ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne