Sciweavers

254 search results - page 6 / 51
» Extended Process Rewrite Systems: Expressiveness and Reachab...
Sort
View
APN
2009
Springer
15 years 4 months ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
Fernando Rosa Velardo, David de Frutos-Escrig
FOSSACS
2007
Springer
15 years 3 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
ECAI
2004
Springer
15 years 2 months ago
Compilation of LTL Goal Formulas into PDDL
Abstract. Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extend...
Stephen Cresswell, Alexandra M. Coddington
BPM
2006
Springer
105views Business» more  BPM 2006»
15 years 1 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 ...
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Expressiveness of Generic Process Shape Types
METAI is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the -calculus,...
Jan Jakubuv, J. B. Wells