THURSDAY

MFCS'98 Workshop on Concurrency

• (14:00 - 16:00) Chair: Javier Esparza
  
  • (14:00 - 14:30)
    R. De Nicola, A. Labella
    The Morphisms and Bisimulations
    
    
  • (14:30 - 15:00)
    D. Hirschkoff
    Automatically Proving Up-to Bisimulation
    
    
  • (15:00 - 15:30)
    G. Ciobanu, M. Rotaru
    A Faithful Graphical Representation of the pi-calculus: Faithful pi-nets
    
    
  • (15:30 - 16:00)
    O. Kushnarenko, S. Pinchinat
    Intentional Approaches for Symbolic Methods
    
    
  
  
• (16:30 - 18:30) Chair: Colin Stirling
  
  • (16:30 - 17:00)
    A. Maggiolo-Schettini, S. Tini
    Projectable Semantics for Statecharts
    
    
  • (17:00 - 17:30)
    I. Virbitskaite
    On the Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics
    
    
  • (17:30 - 18:30) Invited Talk:
    Javier Esparza, Munich
    Unfoldings: verification using partial orders
    
    

FRIDAY

MFCS'98 Workshop on Concurrency

• (14:00 - 16:00) Chair: Wilfried Brauer
  
  • (14:00 - 14:30)
    U. Nitsche
    Construction of an Abstract State-Space from a Partial-Order Representation of the Concrete One
    
    
  • (14:30 - 15:00)
    M. Muller-Olm
    Derivation of Characteristic Formulae
    
    
  • (15:00 - 16:00) Invited Talk:
    Faron Moller, Uppsala
    Pushdown Automata, Multiset Automata, and Petri Net
    
    
  
  
• (16:30 - 18:30) Chair: Petr Jančar
  
  • (16:30 - 17:00)
    O. Burkart
    Queues as Processes
    
    
  • (17:00 - 17:30)
    R. Mayr
    Strict Lower Bounds for Model Checking BPA
    
    
  • (17:30 - 18:00)
    J. Stříbrná
    Hardness Results for Weak Bisimilarity of Simple Process Algebra
    
    
  • (18:00 - 18:30)
    P. Paczkowski
    Characterizing Bisimilarity of Value-passing Processes with Context-free Control
    
    

SATURDAY

MFCS'98 Workshop on Concurrency

• (9:00 - 10:30) Chair: Faron Moller
  
  • (9:00 - 9:30)
    G. Juhas
    The Essence of Petri Nets and Transition Systems through Abelian Groups
    
    
  • (9:30 - 10:00)
    S. Haar
    Branching Processes of General S/T-Systems
    
    
  • (10:00 - 10:30)
    J. Lilius
    Efficient State Space Search for Time Petri Nets
    
    
  
  
• (11:00 - 12:00) Chair: Mojmír Křetínský
  
  • (11:00 - 11:30)
    V. Janousek, T. Vojnar
    State Spaces of Object-Oriented Petri Nets
    
    
  • (11:30 - 12:00)
    I. V. Tarasyuk
    Place Bisimulation Equivalences for Design of Concurrent Systems