Sciweavers

74 search results - page 13 / 15
» Reachability analysis for a class of Petri nets
Sort
View
JSW
2007
126views more  JSW 2007»
13 years 7 months ago
Supporting UML Sequence Diagrams with a Processor Net Approach
— UML sequence diagrams focus on the interaction between different classes. For distributed real time transaction processing it is possible to end up with complex sequence diagra...
Tony Spiteri Staines
QEST
2010
IEEE
13 years 5 months ago
Transient Analysis of Generalised Semi-Markov Processes Using Transient Stochastic State Classes
The method of stochastic state classes approaches the analysis of Generalised Semi Markov Processes (GSMP) through symbolic derivation of probability density functions over Differe...
András Horváth, Lorenzo Ridi, Enrico...
SIMUTOOLS
2008
13 years 9 months ago
Snoopy: a tool to design and animate/simulate graph-based formalisms
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
Monika Heiner, Ronny Richter, Martin Schwarick
EMISA
2002
Springer
13 years 7 months ago
A new reduction method for the analysis of large workflow models
Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...
Loucif Zerguini, Kees M. van Hee
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 1 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...