Pages that link to "Item:Q2365568"
From MaRDI portal
The following pages link to Generating BDDs for symbolic model checking in CCS (Q2365568):
Displaying 8 items.
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- An exercise in the automatic verification of asynchronous designs (Q1329086) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking (Q1884313) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Two-layer symbolic representation for stochastic models with phase-type distributed events (Q2792888) (← links)
- Symbolic model checking for probabilistic processes (Q4571974) (← links)