Pages that link to "Item:Q5476389"
From MaRDI portal
The following pages link to Equivalence-checking on infinite-state systems: Techniques and results (Q5476389):
Displaying 9 items.
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Theory of interaction (Q896903) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Correcting a Space-Efficient Simulation Algorithm (Q3512514) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- (Q5111633) (← links)
