CONCUR 96: Programme and forst call for participation

[------ The Types Forum ------- http://www.dcs.gla.ac.uk/~types ------]

[Many apologies if you receive ths more than once]
			  Pisa, 26--29 August, 1996

			    Preliminary Programme

Monday, 26 August
 Welcome (9:00-9:30)

 Invited Talk (9:30-10:30)

   Retracing Some Paths in Process Algebra,
     Samson Abramsky (Edinburgh)

 Process Algebras (11:00-12:30)

   Process Calculus Based Upon Evaluation to Committed Form,
     Andrew Pitts and Joshua Ross (Cambridge)

   A Process Algebra with Distributed Priorities,
     Rance Cleaveland, Gerald Luettgen, and Vaidhy Natarajan (NCSU)

   Symbolic Transition Graph with Assignment,
     Huimin Lin (Beijing)

 Tutorial (11:00-12:30, parallel session)

   Concurrent Constraint Programming,
     Vijay Saraswat (Xerox PARC)

 Categorical Approaches (14:00-15:30)

   Comparing Transition Systems with Independence and Asynchronous
       Transition Systems,
     Thomas Hildebrandt (Aarhus) and Vladimiro Sassone (Pisa)

   A Presheaf Semantics of Value-Passing Processes,
     Glynn Winskel (Aarhus)

   Elementary Control Structures,
     John Power (Edinburgh)

 Pi-Calculus (16:00-18:00)

   On Transformations of Concurrent Object Programs,
     Anna Philippou and David Walker (Warwick)

   On Bisimulations for the Asynchronous $\pi$-Calculus,
     Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi (INRIA)

   On the Expressiveness of Internal Mobility in Name-Passing Calculi,
     Michele Boreale (Roma)

   Decoding Choice Encodings,
     Uwe Nestmann (INRIA) and Benjamin Pierce (Cambridge)

Tuesday, 27 August
 Invited Talk (9:00-10:00)

   Infinite Results,
     Faron Moller (Uppsala)

 Decidability & Complexity (10:30-12:30)

   Decidability of Bisimulation Equivalence for Normed Pushdown Processes,
     Colin Stirling (Edinburgh)

   The Modal mu-Calculus Alternation Hierarchy is strict,
     J.C. Bradfield (Edinburgh)

   Bisimulation Collapse and the Process Taxonomy,
     Olaf Burkart, Didier Caucal (IRISA), and Bernhard Steffen (Passau)

   On the Expressive Completeness of the Propositional mu-Calculus with
        respect to the Monadic Second Order Logic,
     David Janin (Bordeaux) and Igor Walukiewicz (Aarhus)

 Tutorial (10:30-12:00, parallel session)

   A FACILE Tutorial,
     Bent Thomsen (ICL/IC-PARC)

 Probability (14:00-15:00)

   Testing Probabilistic Automata,
     Roberto Segala (Bologna)

   Extended Markovian Process Algebra,
     Marco Bernardo and Roberto Gorrieri (Bologna)

 Excursion to Volterra (15:00-20:00)

 Conference Dinner (20:00-22:00)

Wednesday, 28 August
 Invited Talk (9:00-10:00)

   Semantic Framework for Concurrency: A Progress Report,
     Jose' Meseguer (SRI)

 Functional & Constraint Programming (10:30-12:30)

   Truly Concurrent Constraint Programming,
     Vineet Gupta (Xerox PARC), Radha Jagadeesan (Loyola), and
     Vijay Saraswat (Xerox PARC)

   Constraints as Processes,
     Bjorn Victor and Joachim Parrow (SICS)

   A Calculus of Mobile Agents,
     Cedric Fournet, Georges Gonthier, Jean-Jacques Levy, Luc Maranget, and
     Didier Remy (INRIA Rocquencourt)

   Algebraic Interpretation of Lambda Calculus with Resources,
     Carolina Lavatelli (LIENS)

 Tutorial (10:30-12:00, parallel session)

   Concurrent Graph and Term Graph Rewriting,
     Andrea Corradini (Pisa)

 Petri Nets (14:00-15:30)

   Petri Boxes and Finite Precedence,
     Raymond Devillers (Bruxelles)

   Constrained Properties, Semilinear Systems, and Petri Nets,
     Ahmed Bouajjani and Peter Habermehl (Verimag)

   Linear Constraint Systems as High-Level Nets,
     Eike Best (Hildesheim) and Catuscia Palamidessi (Genova)

 Verification (16:00-18:00)

   A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking,
     Thomas Henzinger (Berkeley), Orna Kupferman (Bell Labs), and
     Moshe Vardi (Rice)

   State Equivalences for Rectangular Hybrid Automata,
     Thomas Henzinger (Berkeley) and Peter Kopke (Cornell)

   Verifying Abstractions of Timed Systems,
      Serdar Tasiran (Berkeley), Rajeev Alur, Robert Kurshan (Bell Labs),
      and Robert Brayton (Berkeley)

   Towards Automatic Temporal Logic Verification of Value Passing Process
        Algebra Using Abstract Interpretation,
      Alessandro Fantechi (Firenze), Stefania Gnesi and Diego Latella (Pisa)

Thursday, 29 August
 Invited Talk (9:00-10:00)

   Modelling and Verification of Distributed Algorithms,
     Wolfgang Reisig (Berlin)

 Automata & Causality (10:30-12:30)

   An Algorithmic Approach for Checking Closure Properties of
        omega-Regular Languages,
     Doron Peled (Bell Labs), Thomas Wilke (Rutgers), and Pierre Wolper (Liege)

   Towards Automata for Branching Time and Partial Order,
     Michaela Huhn and Peter Niebert (Hildesheim)

   Pomsets without Auto-Concurrency,
     Manfred Droste (Dresden) and Paul Gastin (LITP)

   Action Refinement and Property Inheritance in Systems of Sequential Agents,
     Michaela Huhn (Hildesheim)

 Practical Models (14:00-15:30)

   A Calculus for Concurrent Objects,
     Paolo Di Blasio and Kathleen Fisher (Stanford)

   Refinement in Interworkings,
     Sjouke Mauw and Michel Reniers (Eindhoven)

   Equivalences of Statecharts,
     Andrea Maggiolo-Schettini (Pisa), Adriano Peron (Udine), and
     Simone Tini (Pisa)

 Shared-Memory Systems (16:00-17:30)

   Assumption-Commitment Style Reasoning for shared-variable concurrent
     Jurgen Dingel (CMU)

   The Impact of Hardware Models on Shared Memory Consistency Conditions,
     Jerry James and Ambuj Singh (Santa Barbara)

   Synchronous Development of Asynchronous Systems,
     Clemens Fischer and Wil Janssen (Oldeburgh)

			    Call for Participation

 The 7th International Conference on Concurrency Theory will be held in Pisa
 from August 26 to August 29, 1996. Pisa, conveniently located in upper
 Tuscany on the coast 70 Km away from Florence, is one of Italy's oldest towns
 - its origins date back to the Etruscan, nearly 3,000 years ago. The city
 hosts an old (over 650 years) University that ranks among the best in Italy.

 Pisa is easily reachable by:
 - Air: Daily flights connect Pisa Galilei international airport with several
        important national airports (e.g. Milan, Rome), as well as with
	Frankfurt, London, Munich, and Paris; Florence international airport
	provides direct connections to Amsterdam, Bruxelles, Dusseldorf, and
 - Train: Pisa railway station provides frequent direct connections with many
        Italian destinations, including Genova, Florence, Rome and Turin.
 - Road: Pisa lies at the centre of a large network of roads and motorways,
        including the A11 motorway (from Florence) the A12 (from Genua) and
        the A14 (from Parma and Milan).

 The conference fees are:

                    |  by July 15  | after July 15 |
          | Regular:| LIT. 600,000 |  LIT. 675,000 |
          | Student:| LIT. 300,000 |  LIT. 375,000 |

 The fee (both regular and student rate) includes:
 - proceedings published by Springer Verlag;
 - 4 lunches;
 - excursion to Volterra on Tuesday afternoon; and
 - conference dinner on Tuesday evening.

 Accommodation, other evening meals and any costs related to the satellite
 workshop are not included in the fee. 

 In connection with the conference, some sessions devoted to demonstrations of
 (semi-)automatic academic tools for the analysis and verification of
 concurrent systems are organized. A satellite workshop on Verification of
 Infinite State Systems (VISS) will be held on Friday, August 30.

 More detailed information about the conference and the related activities are
 available at the conference WEB page <http://www.di.unipi.it/~vladi/CONCUR96>
  - including the postscript version of the program, registration and
 accommodation forms, call for demos, and VISS. Should you have any problem
 with the WEB page, please e-mail to concur96@di.unipi.it

 CONCUR96 is jointly sponsored by
 - Universita' di Pisa,
 - GNIM - CNR, 
 - US Office of Naval Reserch, EUROPE.