Sciweavers

66 search results - page 2 / 14
» Reachability Analysis of Process Rewrite Systems
Sort
View
FCT
2007
Springer
13 years 11 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
ENTCS
2002
108views more  ENTCS 2002»
13 years 5 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet
CMSB
2009
Springer
14 years 14 hour ago
Approximation of Event Probabilities in Noisy Cellular Processes
Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time st...
Frédéric Didier, Thomas A. Henzinger...
FOSSACS
2007
Springer
13 years 11 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
BPM
2006
Springer
105views Business» more  BPM 2006»
13 years 9 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 ...