Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Some Personal Views of Net Theory Read chapter Read first chapter

1983 | OriginalPaper | Chapter

Notions of Computability by Petri Nets

Authors : Matthias Jantzen, Hendrik Bramhoff

Published in: Applications and Theory of Petri Nets

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Eleven different definitions for functions to be computable by Petri nets are given and compared. For nine of these definitions it was possible to show that they are not powerful enough to describe all the primitive recursive functions.

previous chapter Formal Semantics by a Combination of Denotational Semantics and High-Level Petri Nets
next chapter High-Level Petri Nets
Metadata
Title
Notions of Computability by Petri Nets
Authors
Matthias Jantzen
Hendrik Bramhoff
Copyright Year
1983
Publisher
Springer Berlin Heidelberg
Book
Applications and Theory of Petri Nets

Print ISBN: 978-3-540-12309-5

Electronic ISBN: 978-3-642-69028-0

Copyright Year: 1983

DOI
https://doi.org/10.1007/978-3-642-69028-0_11

Premium Partner

    Image Credits