Commutative grammars: the complexity of uniform word problems
Information and Control
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Decidability results in automata and process theory
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Communication and Concurrency
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Petri Nets and the Equivalence Problem
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Petri nets with simple circuits
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Parikh's theorem: A simple and direct automaton construction
Information Processing Letters
Behavioural contracts with request-response operations
Science of Computer Programming
Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Safety verification of asynchronous pushdown systems with shaped stacks
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Cellular Resource-Driven Automata
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| Hi-index | 0.00 |
The paper provides a structural characterisation of the reachable markings of Petri nets in which every transition has exactly one input place. As a corollary, the reachability problem for this class is proved to be NP-complete. Further consequences are: the uniform word problem for commutative context-free grammars is NP-complete; weak-bisimilarity is semidecidable for Basic Parallel Processes.