Body na spoluautora | Body za publikaci pro MU | Odkaz ISVaV | 0,00 | 0,00 | On Decidability of LTL+Past Model Checking for Process Rewrite Systems
|
5,98 | 17,94 | On Decidability of LTL Model Checking for Process Rewrite Systems
|
12,70 | 38,11 | Reachability is decidable for weakly extended process rewrite systems
|
6,16 | 12,32 | Characteristic Patterns for LTL
|
7,22 | 14,45 | Characteristic Patterns for LTL
|
9,72 | 19,44 | The stuttering principle revisited
|
4,11 | 12,32 | Reachability of Hennessy - Milner properties for weakly extended PRS
|
12,32 | 12,32 | Reachability Analysis of Multithreaded Software with Asynchronous Communication
|
14,45 | 14,45 | Reachability Analysis of Multithreaded Software with Asynchronous Communication
|
0,00 | 0,00 | Refining Undecidability Border of Weak Bisimilarity.
|
4,82 | 14,45 | Reachability of Hennessy - Milner properties for weakly extended PRS
|
7,22 | 14,45 | Deeper Connections between LTL and Alternating Automata
|
6,16 | 12,32 | Deeper Connections between LTL and Alternating Automata
|
10,06 | 30,19 | On Decidability of LTL Model Checking for Process Rewrite Systems
|
4,82 | 14,45 | On Decidability of LTL Model Checking for Process Rewrite Systems
|
0,00 | 0,00 | On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems
|
0,00 | 0,00 | On Symbolic Verification of Weakly Extended PAD
|
6,71 | 20,14 | Petri Nets Are Less Expressive Than State-Extended PA
|
0,00 | 0,00 | Almost Linear Büchi Automata
|
0,00 | 0,00 | On Symbolic Verification of Weakly Extended PAD
|
20,12 | 20,12 | On Symbolic Verification of Weakly Extended PAD
|
0,00 | 0,00 | On Decidability of LTL+Past Model Checking for Process Rewrite Systems
|
10,06 | 30,19 | Refining Undecidability Border of Weak Bisimilarity
|
0,00 | 0,00 | Refining Undecidability Border of Weak Bisimilarity.
|
Back
(c) Michal Bulant, 2011