Skip to main navigation
Skip to search
Skip to main content
Technical University of Munich Home
Help & FAQ
English
Deutsch
Home
Profiles
Research units
Projects
Research output
Equipment
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM.
Ernst W. Mayr
Stanford University
Research output
:
Contribution to journal
›
Article
›
peer-review
368
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Petri Nets
100%
Reachability Problem
100%
Approximation Error
50%
Computational Complexity of Algorithm
50%
Finite Automata
50%
Approximation Algorithms
50%
Reachability
50%
Tree Construction
50%
Presburger
50%
Firing Sequence
50%
Transition Sequence
50%
Reachability Tree
50%
Computer Science
Approximation (Algorithm)
100%
Reachability Problem
100%
Petri Net
100%
Computational Complexity
50%
Finite Automata
50%
Approximation Algorithms
50%
Tree Construction
50%
Firing Sequence
50%