Sciweavers

209 search results - page 7 / 42
» Dealing with stochastic reachability
Sort
View
BPM
2006
Springer
105views Business» more  BPM 2006»
13 years 11 months ago
Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis
When dealing with complex business processes (e.g., in the context of a workflow implementation or the configuration of some process-aware information system), it is important but ...
Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur ...
CONCUR
2005
Springer
14 years 1 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
JSC
2010
102views more  JSC 2010»
13 years 6 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
STACS
2005
Springer
14 years 1 months ago
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
Kousha Etessami, Mihalis Yannakakis
NN
2006
Springer
13 years 7 months ago
Propagation and control of stochastic signals through universal learning networks
The way of propagating and control of stochastic signals through Universal Learning Networks (ULNs) and its applications are proposed. ULNs have been already developed to form a s...
Kotaro Hirasawa, Shingo Mabu, Jinglu Hu