1369 search results - page 19 / 274 » On the Semantics of Petri Nets |
BIRTHDAY
2010
Springer
13 years 4 months ago
2010
Springer
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
FASE
2005
Springer
14 years 1 months ago
2005
Springer
This paper is concerned with the application of Web services to distributed, cross-organizational business processes. In this scenario, it is crucial to answer the following questi...
DEDS
2006
13 years 7 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
APN
2010
Springer
14 years 15 days ago
2010
Springer
We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.
APN
2001
Springer
14 years 6 days ago
2001
Springer
The increasing number of Petri net variants naturally leads to the question whether the term “Petri net” is more than a common name for very different concepts. This contribut...