957 search results - page 120 / 192 » Negotiations and Petri Nets |
FUIN
2007
14 years 11 months ago
2007
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
ISCIS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a performance modelling case study of a distributed multi-player game expressed in the PEPA nets modelling language. The case study provides a modern complex d...
258
click to vote
ICSE
2012
IEEE-ACM
13 years 2 months ago
2012
IEEE-ACM
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
109
click to vote
INFORMS
1998
14 years 11 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
107
click to vote
APN
1995
Springer
15 years 3 months ago
1995
Springer
The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is s...