Sciweavers

1019 search results - page 67 / 204
» Petri Net Transformations in the
Sort
View
APN
2000
Springer
13 years 11 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
13 years 11 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
13 years 9 months 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
2008
Springer
142views Business» more  BPM 2008»
13 years 9 months ago
Towards Process Models for Disaster Response
In the immediate aftermath of a disaster routine processes, even if specifically designed for such a situation, are not enacted blindly. Actions and processes rather adapt their be...
Dirk Fahland, Heiko Woith
IJCSA
2006
77views more  IJCSA 2006»
13 years 7 months ago
Formal Approach for the Coherence Control of SMIL Documents
This paper presents a formal approach based on Time Petri net (TPN) for the coherence control of SMIL documents. TPN model has been widely used to specify real time systems. The q...
S. Mazouz, D. Dahmani, L. Kaddouri