The following pages link to Faron Moller (Q355064):
Displaying 12 items.
- (Q197788) (redirect page) (← links)
- Modelling computing systems. Mathematics for computer science (Q355066) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Unique decomposition of processes (Q1208422) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- A specification theory of real-time processes (Q1708707) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- (Q2760246) (← links)
- Weak Bisimulation Approximants (Q3613350) (← links)
- Automated Verification of Signalling Principles in Railway Interlocking Systems (Q5178972) (← links)
