Pages that link to "Item:Q1317428"
From MaRDI portal
The following pages link to Deciding bisimulation equivalences for a class of non-finite-state programs (Q1317428):
Displaying 15 items.
- Symbolic bisimulations (Q674194) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
- Inferring Canonical Register Automata (Q2891417) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- Minimal transition systems for history-preserving bisimulation (Q5048942) (← links)
- Deciding bisimulation equivalences for a class of non-finite-state programs (Q5096175) (← links)
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- Equivalence Checking for a Finite Higher Order π-Calculus (Q5458809) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- Ensuring completeness of symbolic verification methods for infinite-state systems (Q5941104) (← links)
