1019 search results - page 31 / 204 » Petri Net Transformations in the |
ROOM
2000
13 years 9 months ago
2000
For the specification of object-oriented systems, usually several models representing different views are developed. The necessary integration of views is often delayed until impl...
LICS
2012
IEEE
11 years 10 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...
AC
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
CSREAESA
2003
13 years 9 months ago
2003
We present an approach for Worst-Case Execution Time (WCET) Analysis of embedded system software, that is generated from Petri net specifications. The presented approach is part ...