The SCEAS System
Navigation Menu

Journals in DBLP

Fundam. Inform.
2007, volume: 79, number: 3-4

  1. Antoni Mazurkiewicz
    Compositional Systems over Reducible Networks. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:265-282 [Journal]
  2. Ludwik Czaja
    Interpreted Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:283-293 [Journal]
  3. Roxana Dietze, Manfred Kudlek, Olaf Kummer
    Decidability Problems of a Basic Class of Object Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:295-302 [Journal]
  4. Berndt Farwer, Manfred Kudlek, Heiko Rölke
    Concurrent Turing Machines. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:303-317 [Journal]
  5. Anna Gomolinska
    Approximation Spaces Based on Relations of Similarity and Dissimilarity of Objects. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:319-333 [Journal]
  6. Damas P. Gruska
    Observation Based System Security. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:335-346 [Journal]
  7. Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Irina A. Lomazova
    Checking Properties of Adaptive Workflow Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:347-362 [Journal]
  8. Gizela Jakubowska, Wojciech Penczek
    Modelling and Checking Timed Authentication of Security Protocols. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:363-378 [Journal]
  9. Agata Janowska, Wojciech Penczek
    Path Compression in Timed Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:379-399 [Journal]
  10. Michael Köhler
    The Reachability Problem for Object Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:401-413 [Journal]
  11. Michael Köhler
    A Formal Model of Multi-Agent Organisations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:415-430 [Journal]
  12. Sergiy Kryvyy, Lyudmila Matvyeyeva
    Algorithm of Translation of MSC-specified System into Petri Net. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:431-445 [Journal]
  13. Manfred Kudlek
    On Semilinear Sets over Commutative Semirings. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:447-452 [Journal]
  14. Miroslaw Kurkowski, Wojciech Penczek
    Verifying Security Protocols Modelled by Networks of Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:453-471 [Journal]
  15. Alessio Lomuscio, Franco Raimondi, Bozena Wozna
    Verification of the TESLA protocol in MCMAS-X. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:473-486 [Journal]
  16. Antoni Mazurkiewicz
    Local Properties of Triangular Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:487-495 [Journal]
  17. James F. Peters, Andrzej Skowron, Jaroslaw Stepaniuk
    Nearness of Objects: Extension of Approximation Space Model. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:497-512 [Journal]
  18. Roman R. Redziejowski
    Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:513-524 [Journal]
  19. Jaroslaw Stepaniuk
    Relational Data and Rough Sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:525-539 [Journal]
  20. Zbigniew Suraj, Barbara Fryc
    Analysis of Approximate Petri Nets by Means of Occurrence Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:541-551 [Journal]
  21. Zbigniew Suraj, Krzysztof Pancerz
    Towards Efficient Computing Consistent and Partially Consistent Extensions of Information Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:553-566 [Journal]
  22. Marcin Wolski
    Approximation Spaces and Nearness Type Structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:567-577 [Journal]
  23. Andrzej Zbrzezny, Agata Pólrola
    SAT-Based Reachability Checking for Timed Automata with Discrete Data. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:3-4, pp:579-593 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002