Sciweavers

1014 search results - page 58 / 203
» ''What Is a Petri Net
Sort
View
APN
2009
Springer
14 years 2 months ago
P-Semiflow Computation with Decision Diagrams
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...
Gianfranco Ciardo, Galen Mecham, Emmanuel Paviot-A...
APN
2000
Springer
14 years 2 months ago
Efficient Symbolic State-Space Construction for Asynchronous Systems
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
Gianfranco Ciardo, Gerald Lüttgen, Radu Simin...
CONCUR
2000
Springer
14 years 2 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
ATAL
2008
Springer
14 years 12 days ago
Theoretical and experimental results on the goal-plan tree problem
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
Patricia H. Shaw, Berndt Farwer, Rafael H. Bordini
BPM
2006
Springer
160views Business» more  BPM 2006»
14 years 11 days ago
Analyzing Interacting BPEL Processes
Abstract. This paper addresses the problem of analyzing the interaction between BPEL processes. We present a technology chain that starts out with a BPEL process and transforms it ...
Niels Lohmann, Peter Massuthe, Christian Stahl, Da...