47 search results - page 2 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
104
Voted
APN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
113
Voted
ACTA
2007
15 years 1 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
113
click to vote
CAV
2010
Springer
15 years 5 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
113
Voted
APN
2010
Springer
15 years 2 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
96
Voted
FUIN
2007
15 years 1 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...