Journals in DBLP

Fundam. Inform.
1999, volume: 37, number: 3

1. Thomas Baar, Ekkart Kindler
   ILF and DAWN for Verifying Distributed Algorithms - An Idea for a Tool. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:201-211 [Journal]
   
2. Ludwik Czaja
   Net-Definability of Process Languages. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:213-223 [Journal]
   
3. Berndt Farwer
   A Linear Logic View of Object Petri Nets. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:225-246 [Journal]
   
4. Keijo Heljanko
   Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:247-268 [Journal]
   
5. Tommi A. Junttila
   Finding Symmetries of Algebraic System Nets. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:269-289 [Journal]
   
6. Ekkart Kindler, Sibylle Peuker
   Integrating Distributed Algorithms into Distributed Systems. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:291-308 [Journal]
   
7. Louchka Popova-Zeugmann, Dirk Schlatter
   Analyzing Paths in Time Petri Nets. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:37, n:3, pp:311-327 [Journal]