The following pages link to (Q4665738):
Displaying 18 items.
- Theory of interaction (Q896903) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- (Q4553282) (← links)
- (Q4790409) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- Bisimilarity of Diagrams (Q5098713) (← links)
- (Q5111633) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- Infinite results (Q6104374) (← links)