3 search results - page 1 / 1 » The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Da... |
LICS
2012
IEEE
11 years 7 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
BMCBI
2006
13 years 4 months ago
2006
Background: Signal transduction pathways are usually modelled using classical quantitative methods, which are based on ordinary differential equations (ODEs). However, some diffic...
VALUETOOLS
2006
ACM
13 years 10 months ago
2006
ACM
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...