Fundamenta Informaticae, Volume 93

Volume 93, Numbers 1-3, 2009

• Krzysztof Balicki, Marcin Szpyrka:
  Formal Definition of XCCS Modelling Language. 1-15
  
• Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
  P Systems with Transport and Diffusion Membrane Channels. 17-31
  
• Kamila Barylska, Edward Ochmanski:
  Levels of Persistency in Place/Transition Nets. 33-43
  
• Marco Bellia, M. Eugenia Occhiuto:
  JavaOmega: The Structures and the Implementation of a Preprocessor for Java with m and mc parameters. 45-64
  
• Katarzyna Budzynska, Magdalena Kacprzak, Pawel Rembelski:
  Perseus. Software for Analyzing Persuasion Process. 65-79
  
• Nils Bulling, Wojciech Jamroga:
  What Agents Can Probably Enforce. 81-96
  
• Ludwik Czaja, Manfred Kudlek:
  Analysis and Synthesis of Net Structures and Transition Graphs. 97-110
  
• Anatoliy Doroshenko, Olena Yatsenko:
  Using Ontologies and Algebra of Algorithms for Formalized Development of Parallel Programs. 111-125
  
• Natalya Gribovskaya, Irina Virbitskaite:
  Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems. 127-142
  
• Piotr Grochowalski, Krzysztof Pancerz:
  The Outline of an Ontology for the Rough Set Theory and its Applications. 143-154
  
• Damas P. Gruska:
  Quantifying Security for Timed Process Algebras. 155-169
  
• Kees M. van Hee, Natalia Sidorova, Marc Voorhoeve, Jan Martijn E. M. van der Werf:
  Generation of Database Transactions with Petri Nets. 171-184
  
• Gizela Jakubowska, Piotr Dembinski, Wojciech Penczek, Maciej Szreter:
  Simulation of Security Protocols based on Scenarios of Attacks. 185-203
  
• Michael Kohler-Bußmeier, Frank Heitmann:
  On the Expressiveness of Communication Channels for Object Nets. 205-219
  
• Manfred Kudlek, Patrick Totzke, Georg Zetzsche:
  Multiset Pushdown Automata. 221-233
  
• Manfred Kudlek, Patrick Totzke, Georg Zetzsche:
  Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. 235-244
  
• Miroslaw Kurkowski, Wojciech Penczek:
  Timed Automata Based Model Checking of Timed Security Protocols. 245-259
  
• Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
  On Minimal Inhibitory Rules for Almost All k-Valued Information Systems. 261-272
  
• Linh Anh Nguyen:
  An Efficient Tableau Prover using Global Caching for the Description Logic ALC. 273-288
  
• Artur Niewiadomski, Wojciech Penczek, Maciej Szreter:
  A New Approach to Model Checking of UML State Machines. 289-303
  
• Artur Rataj, Bozena Wozna, Andrzej Zbrzezny:
  A Translator of Java Programs to TADDs. 305-324
  
• Roman R. Redziejowski:
  Applying Classical Concepts to Parsing Expression Grammar. 325-336
  
• Jan-Thierry Wegener, Louchka Popova-Zeugmann:
  Petri Nets with Time Windows: A Comparison to Classical Petri Nets. 337-352
  

Volume 93, Number 4, 2009

• Janusz Czelakowski:
  AC is Equivalent to the Coherence Principle. Corrigendum to my Paper "Induction Principles for Sets". 353-356
  
• Liviu Petrisor Dinu:
  On Insertion Grammars with Maximum Parallel Derivation. 357-369
  
• Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
  Branching Bisimilarity with Explicit Divergence. 371-392
  
• Yuxia Lei, Yuefei Sui, Cungen Cao:
  Normalized-scale Relations and Their Concept Lattices in Relational Databases. 393-409
  
• Maciej Paszynski:
  On the Parallelization of Self-Adaptive hp-Finite Element Methods Part I. Composite Programmable Graph GrammarModel. 411-434
  
• Maciej Paszynski:
  On the Parallelization of Self-Adaptive hp-Finite Element Methods Part II. Partitioning Communication Agglomeration Mapping (PCAM) Analysis. 435-457
  
• Ling Zhang, Fu-gui He, Yanping Zhang, Shu Zhao:
  A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space. 459-469