25 search results - page 3 / 5 » Symbolic Reachability Analysis of Integer Timed Petri Nets |
MMM
2005
Springer
14 years 1 months ago
2005
Springer
A composite multimedia object (cmo) is comprised of different media components such as text, video, audio and image, with a variety of constraints that must be adhered to. The con...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
JSW
2008
13 years 7 months ago
2008
Precise analysis of the Web structure can facilitate data pre-processing and enhance the accuracy of the mining results in the procedure of Web usage mining. STPN Stochastic Timed...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
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...
APN
2007
Springer
14 years 1 months ago
2007
Springer
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...