#### DMCA

## Name creation vs. Replication in Petri Net Systems (2008)

### Cached

### Download Links

Citations: | 17 - 5 self |

### Citations

1174 | A Calculus of Mobile Processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...h dynamic creation of threads. Dynamic name generation has also been thoroughly studied, mainly in the field of security and mobility [13]. Paradigmatic examples of nominal calculi are the π-calculus =-=[16]-=-, and the Ambient Calculus [6]. Since the early versions of all these calculi are Turing complete, numerous efforts have been focused on the static analysis of undecidable properties [7, 17] and in th... |

247 | Well-structured transition systems everywhere! Theor
- Finkel, Schnoebelen
- 2001
(Show Context)
Citation Context ...re in between ordinary P/T nets and Turing machines. The latter was proved by taking into account the abstract nature of created names. More precisely, we proved that they are well structured systems =-=[11]-=- when we consider the order defined by M1 ⊑α M2 ⇔ if there is some M ′ such that M1 ≡α M ′ (they are equal up to renaming of identifier tokens) and M ′ (p) ⊆ M2(p) ∀p ∈ P. All these results are trivia... |

152 |
Undecidability of bounded security protocols
- Durgin, Lincoln, et al.
- 1999
(Show Context)
Citation Context ...ctions between the concepts discussed in this paper and the (un)decidability of properties that we have obtained, and those used and obtained in the field of security protocols, like those studied in =-=[10]-=-. In particular, the study of the restrictions needed to preserve the decidability of coverability, could be related with some other recent studies in the field of security protocols [19, 20], while w... |

114 | Context-sensitive synchronization-sensitive analysis is undecidable
- Ramalingam
- 2000
(Show Context)
Citation Context ...y. 1 Introduction Extensive work has been developed in the last years in the field of multithreaded programs [21]. In general, once thread synchronization is allowed, reachability becomes undecidable =-=[18]-=-, so that the effort is devoted to compute overapproximations of the set of reachable markings. For instance, [2] studies the case where threads are finite state, [3] considers a framework to statical... |

94 | A generic approach to the static analysis of concurrent programs with procedures
- Bouajjani, Esparza, et al.
- 2003
(Show Context)
Citation Context ...reachability becomes undecidable [18], so that the effort is devoted to compute overapproximations of the set of reachable markings. For instance, [2] studies the case where threads are finite state, =-=[3]-=- considers a framework to statically analyze multithreaded systems with a fixed number of infinite-state communicating threads, and in [4] that work is extended to cope with dynamic creation of thread... |

72 | Unreliable channels are easier to verify than perfect channels - Cécé, Finkel, et al. - 1996 |

44 | 2002): Types for the Ambient Calculus
- Cardelli, Ghelli, et al.
(Show Context)
Citation Context ...e π-calculus [16], and the Ambient Calculus [6]. Since the early versions of all these calculi are Turing complete, numerous efforts have been focused on the static analysis of undecidable properties =-=[7, 17]-=- and in the restriction of the original formalisms [5, 27] to get more manageable languages where some interesting properties become decidable. In this paper we investigate the relationships between n... |

32 | Nets with tokens which carry data - Lazić, Newcomb, et al. |

30 | S.K.: Parameterized verification of multithreaded software libraries
- Ball, Chaki, et al.
- 2001
(Show Context)
Citation Context ... In general, once thread synchronization is allowed, reachability becomes undecidable [18], so that the effort is devoted to compute overapproximations of the set of reachable markings. For instance, =-=[2]-=- studies the case where threads are finite state, [3] considers a framework to statically analyze multithreaded systems with a fixed number of infinite-state communicating threads, and in [4] that wor... |

17 | On the coverability problem for constrained multiset rewriting - Abdulla, Delzanno |

15 | S.: Tagging makes secrecy decidable with unbounded nonces as well - Ramanujam, Suresh - 2003 |

13 | L.V.: Comparing the expressive power of well-structured transition systems - Abdulla, Delzanno, et al. - 2007 |

13 | Decidability of context-explicit security protocols - Ramanujam, Suresh |

12 | Reachability analysis of synchronized PA systems
- Bouajjani, Esparza, et al.
(Show Context)
Citation Context ...nstance, [2] studies the case where threads are finite state, [3] considers a framework to statically analyze multithreaded systems with a fixed number of infinite-state communicating threads, and in =-=[4]-=- that work is extended to cope with dynamic creation of threads. Dynamic name generation has also been thoroughly studied, mainly in the field of security and mobility [13]. Paradigmatic examples of n... |

12 | On the expressiveness of Mobile Synchronizing Petri Nets
- Rosa-Velardo, Frutos-Escrig, et al.
- 2007
(Show Context)
Citation Context ...ig. 2. Autonomous (left) and synchronizing (right) transitions restrict synchronizations to happen only between components that know a particular name, as we have illustrated with several examples in =-=[24]-=-. We can use this mechanism to deal with authentication issues in our systems. We formalize the latter by replacing ordinary tokens by distinguishable tokens, thus adding a touch of colour to our nets... |

11 |
Abstract interpretation of Mobile Ambients
- Nielson, Hansen, et al.
(Show Context)
Citation Context ...e π-calculus [16], and the Ambient Calculus [6]. Since the early versions of all these calculi are Turing complete, numerous efforts have been focused on the static analysis of undecidable properties =-=[7, 17]-=- and in the restriction of the original formalisms [5, 27] to get more manageable languages where some interesting properties become decidable. In this paper we investigate the relationships between n... |

11 | On the expressiveness of pure mobile ambients
- Zimmer
(Show Context)
Citation Context ... early versions of all these calculi are Turing complete, numerous efforts have been focused on the static analysis of undecidable properties [7, 17] and in the restriction of the original formalisms =-=[5, 27]-=- to get more manageable languages where some interesting properties become decidable. In this paper we investigate the relationships between name creation and replication in this setting of infinite-s... |

9 |
An overview of MSR(C): A CLP-based framework for the symbolic verification of parameterized concurrent systems
- Delzanno
(Show Context)
Citation Context ... suggests that coverability remains decidable in that case. It would also be desirable to establish a complete hierarchy of models, including those appearing in [23], and other related models such as =-=[8, 9, 15]-=-. This hierarchy would be based on the quantity of information about the past that a configuration of a system remembers [22]. For instance, the difference between replication with and without garbage... |

9 | Names. In: Distributed Systems - Needham - 1989 |

9 | Forward reachability analysis of timed Petri nets - Abdulla, Deneux, et al. - 2004 |

8 | Undecidability in object-oriented Petri nets
- Kummer
(Show Context)
Citation Context ..., one marking each. 1 In fact, analogous results could be obtained if we could also check inequality. p∈P6 In fact, ν-net systems with a single component correspond to the minimal OO-nets defined in =-=[14]-=-. As for any kind of coloured Petri nets, transitions are fired relative to a mode σ : Var(t) → Id, that chooses among the tokens that lie in the precondition places. We will denote modes by σ,σ ′ ,σ1... |

7 | Deciding reachability in mobile ambients
- Busi, Zavattaro
(Show Context)
Citation Context ... early versions of all these calculi are Turing complete, numerous efforts have been focused on the static analysis of undecidable properties [7, 17] and in the restriction of the original formalisms =-=[5, 27]-=- to get more manageable languages where some interesting properties become decidable. In this paper we investigate the relationships between name creation and replication in this setting of infinite-s... |

5 |
Mobile Ambients. 1st Int
- Cardelli, Gordon
- 1998
(Show Context)
Citation Context ...Dynamic name generation has also been thoroughly studied, mainly in the field of security and mobility [13]. Paradigmatic examples of nominal calculi are the π-calculus [16], and the Ambient Calculus =-=[6]-=-. Since the early versions of all these calculi are Turing complete, numerous efforts have been focused on the static analysis of undecidable properties [7, 17] and in the restriction of the original ... |

5 |
2007): Constraint-based automatic verification of abstract models of multithreaded programs
- Delzanno
(Show Context)
Citation Context ...istinguish between what at first were indistinguishable components, so that now threads can have a unique personality. A formalism that encompasses both dynamic name generation and replication is TDL =-=[9]-=-. In TDL there are primitives both for name creation and thread creation. However, no garbage collection mechanism is considered, neither for names nor for threads. As a consequence, and quite surpris... |

5 | Coding Mobile Synchronizing Petri Nets into Rewriting Logic”, this paper is electronically published
- Rosa-Velardo
(Show Context)
Citation Context ...the configuration to remember the number of replicated componentes, which we do not do in the latter. We are also interested in the practical implementation of the results presented in this paper. In =-=[25]-=- we presented a prototype of a tool for the verification of MSPN systems, which mainly corresponds to our ν-nets here. We plan to extend it to include the replication operator and coverability, bounde... |

3 | Frutos-Escrig. Mobile synchronizing petri nets: a choreographic approach for coordination in ubiquitous systems
- Rosa-Velardo, Marroqúın-Alonso, et al.
- 2006
(Show Context)
Citation Context ...possible to simulate every width-bounded ν-net by means of a ν-net that does not use the ν-variable, that is, that does not create any identifier, and nets in this subclass are equivalent to P/T nets =-=[23]-=-. Proposition 7. Every width-bounded ν-net can be simulated by a ν-net without name creation. The simulation is based on the fact that, for identifiers that can appear a bounded number of times, we ca... |

3 |
Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification
- Lazić
- 2005
(Show Context)
Citation Context ... suggests that coverability remains decidable in that case. It would also be desirable to establish a complete hierarchy of models, including those appearing in [23], and other related models such as =-=[8, 9, 15]-=-. This hierarchy would be based on the quantity of information about the past that a configuration of a system remembers [22]. For instance, the difference between replication with and without garbage... |

2 |
Notes on Nominal Calculi for Security and Mobility. Foundations of Security Analysis and Design, FOSAD’00
- Gordon
- 2001
(Show Context)
Citation Context ...ommunicating threads, and in [4] that work is extended to cope with dynamic creation of threads. Dynamic name generation has also been thoroughly studied, mainly in the field of security and mobility =-=[13]-=-. Paradigmatic examples of nominal calculi are the π-calculus [16], and the Ambient Calculus [6]. Since the early versions of all these calculi are Turing complete, numerous efforts have been focused ... |

1 |
Analysis of multithreaded programs. 8th Static Analysis
- Rinard
- 2001
(Show Context)
Citation Context ...surprisingly, Turing complete and therefore, more expressive than when considered separately. 1 Introduction Extensive work has been developed in the last years in the field of multithreaded programs =-=[21]-=-. In general, once thread synchronization is allowed, reachability becomes undecidable [18], so that the effort is devoted to compute overapproximations of the set of reachable markings. For instance,... |

1 |
Replicated Ubiquitous Nets
- Rosa-Velardo, Frutos-Escrig, et al.
- 2006
(Show Context)
Citation Context ...kens lie in them, thus making impossible the firing of any of its transitions (supposing, without loss of generality that every transition has at least one precondition). In such a case, we proved in =-=[26]-=- that both reachability and coverability are decidable. The former is proved by taking into account that markings must remember the number of created components, even if some of them are deadlocked. S... |

1 | On the Expressiveness of Pure Mobile Ambients. 7th Int. Workshop on Expressiveness - Zimmer |

1 |
Segura Díaz and David de Frutos Escrig. Tagged systems: a framework for the specification of history dependent properties
- Velardo, C
(Show Context)
Citation Context ... including those appearing in [23], and other related models such as [8, 9, 15]. This hierarchy would be based on the quantity of information about the past that a configuration of a system remembers =-=[22]-=-. For instance, the difference between replication with and without garbage collection is that in the former case we force the configuration to remember the number of replicated componentes, which we ... |