47 search results - page 6 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
WRLA
2010
14 years 8 months ago
2010
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...
APN
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
APN
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
89
Voted
ECMDAFA
2010
Springer
15 years 27 days ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...