941 search results - page 31 / 189 » History-Dependent Petri Nets |
FUIN
2007
13 years 8 months ago
2007
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
VALUETOOLS
2006
ACM
14 years 2 months ago
2006
ACM
This paper proposes the modeling of technical systems and their behavior by means of Unified Modeling Language (UML) State Machines and the extending UML Profile for Schedulabil...
AC
2003
Springer
14 years 2 months 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 1 months 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...
APN
2000
Springer
14 years 1 months ago
2000
Springer
: In this paper, we suggest a requirement engineering process that generates a user interface prototype from scenarios and yields a formal specification of the system in form of a ...