The following pages link to (Q2736352):
Displaying 16 items.
- The expressive power of implicit specifications (Q685409) (← links)
- On process equivalence = equation solving in CCS (Q839034) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- Modal event-clock specifications for timed component-based design (Q1951603) (← links)
- Design of reactive algorithms by solving equations over automata (Q2263188) (← links)
- On the greatest solution of equations in \(\mathrm{CLL}_R\) (Q2353634) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- Factorization for Component-Interaction Automata (Q2891388) (← links)
- (Q3384160) (← links)
- (Q4853315) (← links)
- Negative Results on Decidability and Small Model Property of Process Equations (Q5217303) (← links)
- Complexity of Decision Problems for Mixed and Modal Specifications (Q5458354) (← links)
- On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
- Branching time controllers for discrete event systems (Q5958466) (← links)
- Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)
- Robust almost-sure reachability in multi-environment MDPs (Q6535373) (← links)
