Prikaz rezultata 1 – 20 od 21 za pretragu 'Lazic, R', vrijeme upita: 0,04s
Detaljiziraj rezultate
-
1
Verifying Determinism of Concurrent Systems Which Use Unbounded Arrays od Roscoe, A, Lazic, R
Izdano 1998Conference item -
2
-
3
-
4
-
5
Polymorphic Systems with Arrays‚ 2−Counter Machines and Multiset Rewriting od Roscoe, A, Lazic, R, Newcomb, T
Izdano 2004Conference item -
6
Polymorphic systems with arrays: decidability and undecidability od Roscoe, A, Lazic, R, Newcomb, T
Izdano 2003Conference item -
7
On Model Checking Data−independent Systems with Arrays without Reset od Roscoe, A, Lazic, R, Newcomb, T
Izdano 2001Conference item -
8
On Model checking data−independent systems with arrays with whole−array operations od Roscoe, A, Lazic, R, Newcomb, T
Izdano 2005Conference item -
9
On Model Checking Data−independent Systems with Arrays without Reset od Roscoe, A, Lazic, R, Newcomb, T
Izdano 2004Journal article -
10
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption od Roscoe, A, Wang, X, Lazic, R
Izdano 2004Conference item -
11
Zeno, Hercules, and the Hydra: Safety metric temporal logic is Ackermann-complete od Lazić, R, Ouaknine, J, Worrell, J
Izdano 2016Journal article -
12
-
13
Leafy automata for higher-order concurrency od Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I
Izdano 2021Conference item -
14
A polynomial-time algorithm for reachability in branching VASS in dimension one od Göller, S, Haase, C, Lazic, R, Totzke, P
Izdano 2016Conference item -
15
Verifying higher-order concurrency with data automata od Dixon, A, Lazić, R, Murawski, AS, Walukiewicz, I
Izdano 2021Conference item -
16
Nets with Tokens Which Carry Data od Roscoe, A, Lazic, R, Newcomb, T, Ouaknine, J, Worrell, J
Izdano 2007Journal article -
17
Nets with tokens which carry data od Lazić, R, Newcomb, T, Ouaknine, J, Roscoe, A, Worrell, J
Izdano 2008Journal article -
18
Nets with Tokens which Carry Data od Lazic, R, Newcomb, T, Ouaknine, J, Roscoe, A, Worrell, J
Izdano 2008Journal article -
19
When are emptiness and containment decidable for probabilistic automata? od Daviaud, L, Jurdziński, M, Lazić, R, Worrell, JB, Et al.
Izdano 2021Journal article -
20
When is containment decidable for probabilistic automata? od Daviaud, L, Jurdziński, M, Lazić, R, Mazowiecki, F, Pérez, G, Worrell, J
Izdano 2018Conference item