Publication:4942620
From MaRDI portal
zbMath0941.68644MaRDI QIDQ4942620
Publication date: 16 March 2000
undecidability; language equivalence; labelled Petri nets; reachability set equality; semilinear bisimulations
03D35: Undecidability and degrees of sets of sentences
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Deciding properties of integral relational automata, Pushdown automata, multiset automata, and Petri nets, Decidability of model checking with the temporal logic EF, Undecidability of bisimilarity for Petri nets and some related problems, Decision problems for pushdown threads, Decidability of bisimulation equivalence for normed pushdown processes, A polynomial algorithm for deciding bisimilarity of normed context-free processes, On detectability of labeled Petri nets and finite automata, Decidability of branching bisimulation on normed commutative context-free processes, Decidability of performance equivalence for basic parallel processes