The following pages link to Hagen Völzer (Q834900):
Displaying 16 items.
- (Q235203) (redirect page) (← links)
- A constructive proof for FLP (Q834901) (← links)
- Petri net based verification of distributed algorithms: An example (Q1377301) (← links)
- Computing the concurrency threshold of sound free-choice workflow nets (Q2324223) (← links)
- Probabilistic event structures and domains (Q2503038) (← links)
- Counterexamples in Probabilistic LTL Model Checking for Markov Chains (Q3184702) (← links)
- (Q3396595) (← links)
- (Q4484510) (← links)
- (Q4791268) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311494) (← links)
- Distributed Computing (Q5395135) (← links)
- Defining Fairness in Reactive and Concurrent Systems (Q5395684) (← links)
- Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths (Q5458863) (← links)
- Automata, Languages and Programming (Q5466450) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897501) (← links)
- Algebraic nets with flexible arcs (Q5958125) (← links)
