|
|
Journals in DBLP
- Felice Balarin
Verifying invariants by approximate image computation. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Géraud Sénizergues
L(A) = L(B)? [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Faron Moller
Preface. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- David Lesens, Hassen Saïdi
Abstraction of parameterized networks. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Petr Jancar, Antonín Kucera
Bisimilarity of processes with finite-state systems. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Laurent Fribourg, Hans Olsén
Reachability sets of parameterized rings as regular languages. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Alain Finkel, Bernard Willems, Pierre Wolper
A direct symbolic approach to model checking pushdown systems. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Dennis Dams, Rob Gerth
The bounded retransmission protocol revisited. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Olaf Burkart
Model checking rationally restricted right closures of recognizable graphs. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Zakaria Bouziane, Alain Finkel
Cyclic Petri net reachability sets are semi-linear effectively constructible. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
- Jitka Stríbrná
Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
|
