Fundamenta Informaticae, Volume 80

Volume 80, Numbers 1-3, 2007

• Volker Diekert, Martin Horsch, Manfred Kufleitner:
  On First-Order Fragments for Mazurkiewicz Traces. 1-29
  
• Luca Bernardinello, Elena Monticelli, Lucia Pomello:
  On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces. 31-47
  
• Jonathan Billington, Bing Han:
  Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties. 49-74
  
• Eike Best, Philippe Darondeau, Harro Wimmel:
  Making Petri Nets Safe and Free of Internal Transitions. 75-90
  
• Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone:
  Static BiLog: a Unifying Language for Spatial Structures. 91-110
  
• Joost Engelfriet, Hendrik Jan Hoogeboom:
  Finitary Compositions of Two-way Finite-State Transductions. 111-123
  
• Jacques Carette, Ryszard Janicki:
  Computing Properties of Numerical Imperative Programs by Symbolic Computation. 125-146
  
• Blaise Genest, Dietrich Kuske, Anca Muscholl:
  On Communicating Automata with Bounded Channels. 147-167
  
• Paul Gastin, Dietrich Kuske:
  Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. 169-197
  
• Jetty Kleijn, Maciej Koutny:
  Processes of Petri Nets with Range Testing. 199-219
  
• Jérémie Chalopin, Yves Métivier:
  An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. 221-246
  
• Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
  On Minimal Rule Sets for Almost All Binary Information Systems. 247-258
  
• Edward Ochmanski, Joanna Pieckowska:
  On Ethics of Mazurkiewicz Traces. 259-272
  
• Wolfgang Reisig:
  The Decent Philosophers: An Exercise in Concurrent Behaviour. 273-281
  
• Xu Wang, Marta Z. Kwiatkowska:
  On Process-algebraic Verification of Asynchronous Circuits. 283-310
  
• Józef Winkowski:
  Towards a Framework for Modelling Behaviours of Hybrid Systems. 311-332
  

Volume 80, Number 4, 2007

• Jan A. Bergstra, C. A. Middelburg:
  Maurer Computers with Single-Thread Control. 333-362
  
• Alain Bui, Devan Sohier:
  How to Compute Times of Random Walks Based Distributed Algorithms. 363-378
  
• Mariusz Flasinski:
  Inference of Parsable Graph Grammars for Syntactic Pattern Recognition. 379-413
  
• Céline Hébert, Alain Bretto, Bruno Crémilleux:
  A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation. 415-433
  
• Feng Jiang, Yuefei Sui, Cungen Cao:
  Formal Concept Analysis in Relational Database and Rough Relational Database. 435-451
  
• Fagen Li, Yupu Hu:
  Security Analysis of the Pomykala-Barabasz Scheme. 453-459
  
• Rongxing Lu, Zhenfu Cao, Xiaolei Dong:
  A New Practical Limited Identity-Based Encryption Scheme. 461-474
  
• Pradipta Maji, Sankar K. Pal:
  RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets. 475-496