|
|
Journals in DBLP
- Olaf Burkart, Javier Esparza
More infinite results. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Pawel Paczkowski
Characterizing bisimilarity of value-passing parametrised processes. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Monica Nesi
Mechanising a modal logic for value-passing agents in HOL. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Richard Mayr
Semantic reachability. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Olga Kouchnarenko, Ph. Schnoebelen
A model for recursive-parallel programs. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Yoram Hirshfeld
Bisimulation trees and the decidability of weak bisimulations. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Dilian Gurov, Sergey Berezin, Bruce M. Kapron
A modal mu-calculus and a proof system for value passing processes. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Régis Cridlig
Semantic analysis of concurrent ML by abstract model-checking. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Ivana Cerná, Mojmír Kretínský, Antonín Kucera
Bisimilarity is decidable in the union of normed BPA and normed BPP processes. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Olaf Burkart, Yves-Marie Quemener
Model-checking of infinite graphs defined by graph grammars. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
- Bernhard Steffen
Preface. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
|
