On the Expressiveness of Mobile Synchronizing Petri Nets
Reads0
Chats0
TLDR
This paper discusses the expressiveness of the extended model with the authentication primitives, and proves that both models are strictly in between P/T nets and Turing machines.About:
This article is published in Electronic Notes in Theoretical Computer Science.The article was published on 2007-06-01 and is currently open access. It has received 31 citations till now. The article focuses on the topics: Petri net & Process architecture.read more
Citations
More filters
Book ChapterDOI
Nets with Tokens which Carry Data
TL;DR: The main result of the paper is that, even for unordered data domains, each of the three verification problems for data nets without whole-place operations has non-elementary complexity.
Journal ArticleDOI
Decidability and complexity of Petri nets with unordered data
TL;DR: It is proved that the corresponding “place version” of all the boundedness problems is undecidable for ν -PN, an extension of P/T nets with pure name creation and name management.
Compositional design and verification of component-based information systems
Jmem Jan Martijn Werf,van der +1 more
TL;DR: A process discovery algorithm based on integer linear programming is presented, which can handle negative instances that describe undesired behavior and is directly usable as a prototype, as it has execution semantics.
Book ChapterDOI
Name creation vs. replication in Petri net systems
TL;DR: In this paper, the authors studied the relationship between name creation and replication in a setting of infinite-state communicating automata and proved that name creation is equivalent to replication, but only when a garbage collection mechanism is added for idle threads.
Journal Article
Name Creation vs. Replication in Petri Net Systems
TL;DR: It is proved that in this setting name creation and replication are equivalent, but only when a garbage collection mechanism is added for idle threads, which is a bit surprisingly, Turing complete and therefore, more expressive than when considered separately.
References
More filters
Journal Article
The computer for the 21st century
TL;DR: In this article, the authors propose that specialized elements of hardware and software, connected by wires, radio waves and infrared, will soon be so ubiquitous that no-one will notice their presence.
Journal ArticleDOI
Some computer science issues in ubiquitous computing
TL;DR: What is new and different about the computer science in ubiquitous computing is explained, and a series of examples drawn from various subdisciplines of computer science are outlined.
Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods
TL;DR: This is the third volume of a definitive work on coloured Petri nets and contains a detailed presentation of 19 applications of CP-nets across a broad range of application areas, including a security system, ATM networks, audio/video systems, transaction processing, ISDN services, VLSI chips, document storage, distributed programming, electronic funds transfer, and many more.
Book ChapterDOI
Theories for the Global Ubiquitous Computer
TL;DR: An initiative to provide theories that can underlie the development of the Global Ubiquitous Computer, the network of ubiquitous computing devices that will pervade the civilised world in the course of the next few decades is described.