Volume 67, Number 1-3, 2005
Concurrency Specification and Programming (CS&P 2004)
Ludwik Czaja:
An Axiomatic Framework for Proving Correctness of Nets. 45-64
Anna Gomolinska:
Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces. 77-92
Rafal Latkowski:
Flexible Indiscernibility Relations for Missing Attribute Values. 131-147
Diemo Urbig:
Weight-Based Negotiation Mechanisms: Balancing Personal Utilities. 271-285
Andrzej Zbrzezny:
SAT-based Reachability Checking for Timed Automata with Diagonal Constraints. 303-322
Volume 67, Number 4, 2005
Ionut Popa:
KDS-transformation for Data Compression. 371-375