scientific article; zbMATH DE number 1414283
From MaRDI portal
Publication:4942620
zbMath0941.68644MaRDI QIDQ4942620
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitylanguage equivalencelabelled Petri netsreachability set equalitysemilinear bisimulations
Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (15)
Petri nets, commutative context-free grammars, and basic parallel processes ⋮ A polynomial algorithm for deciding bisimilarity of normed context-free processes ⋮ On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions ⋮ Decision problems for pushdown threads ⋮ High undecidability of weak bisimilarity for Petri nets ⋮ Infinite results ⋮ On detectability of labeled Petri nets and finite automata ⋮ Deciding properties of integral relational automata ⋮ Undecidability of bisimilarity for Petri nets and some related problems ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ Decidability of branching bisimulation on normed commutative context-free processes ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Decidability of model checking with the temporal logic EF ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Decidability of bisimulation equivalence for normed pushdown processes
This page was built for publication:
