14 search results - page 1 / 3 » Hasse Diagram Generators and Petri Nets |
APN
2009
Springer
13 years 11 months ago
2009
Springer
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
AOSE
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we introduce an approach for defining semantics for AUML agent interaction protocol diagrams using Petri net code structures. This approach is based on the...
APN
2000
Springer
13 years 9 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 ...
APN
2004
Springer
13 years 10 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
APN
2009
Springer
13 years 9 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...