Electronic Notes in Theoretical Computer Science, Volume 18

Volume 18, 1998

• Petr Jancar, Mojmír Kretínský:
  Preface.
  
• Faron Moller:
  A Taxonomy of Infinite State Processes.
  
• Olaf Burkart:
  Queues as Processes.
  
• Gabriel Ciobanu, Mihai Rotaru:
  Faithful pi-nets - A graphical representation of the asynchronous pi-calculus .
  
• Rocco De Nicola, Anna Labella:
  Tree Morphisms and Bisimulations.
  
• Stefan Haar:
  Branching Processes of general S/T-Systems and their properties.
  
• Daniel Hirschkoff:
  Automatically Proving Up-to Bisimulation.
  
• Gabriel Juhás:
  The essence of Petri nets and transition systems through Abelian groups.
  
• Olga Kushnarenko, Sophie Pinchinat:
  Intensional Approaches for Symbolic Methods.
  
• Johan Lilius:
  Efficient State Space Search for Time Petri Nets.
  
• Andrea Maggiolo-Schettini, Simone Tini:
  Projectable Semantics for Statecharts.
  
• Richard Mayr:
  Strict Lower Bounds for Model Checking BPA.
  
• Markus Müller-Olm:
  Derivation of Characteristic Formulae.
  
• Pawel Paczkowski:
  Towards characterizing bisimilarity of value-passing processes with context-free control.
  
• Jitka Stríbrná:
  Hardness results for weak bisimilarity of simple process algebras.
  
• Igor V. Tarasyuk:
  Place bisimulation equivalences for design of concurrent and sequential systems.
  
• Irina Virbitskaite:
  On Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics.
  
• Ulrich Ultes-Nitsche:
  Towards the Construction of an Abstract State-Space from a Partial-Order Representation of the Concrete One.