CONCUR '95 Concurrency Theory

Inhaltsverzeichnis

Local model checking games (extended abstract).- Compositional proof systems for model checking infinite state processes.- Compositional model checking of real time systems.- Checking bisimilarity for finitary ?-calculus.- The weak late ?-calculus semantics as observation equivalence.- The fixpoint-analysis machine.- Unique fixpoint induction for mobile processes.- A polymorphic type system for the polyadic ?-calculus.- Fibrational control structures.- Fully abstract models for nondeterministic regular expressions.- A Petri net semantics for ?-calculus.- A complete theory of deterministic event structures.- Characterizing behavioural congruences for Petri nets.- Verification of a distributed summation algorithm.- Confluence for process verification.- Axiomatisations of weak equivalences for De Simone languages.- A compositional trace-based semantics for probabilistic automata.- Acceptance trees for probabilistic processes.- Will I be pretty, will I be rich? Some thoughts on theory vs. practice in systems engineering.- Towards a denotational semantics for ET-LOTOS.- Reachability analysis at procedure level through timing coincidence.- Faster asynchronous systems.- Fair testing.- Formal methods technology transfer: Impediments and innovation (abstract).- Decidability of simulation and bisimulation between lossy channel systems and finite state systems.- Checking regular properties of Petri nets.- Metric predicate transformers: Towards a notion of refinement for concurrency.- A refinement theory that supports both 'decrease of nondeterminism' and 'increase of parallelism'.- Model checking and efficient automation of temporal reasoning.- Verifying parameterized networks using abstraction and regular languages.- On the complexity of branching modular model checking.- Axiomatising linear time mu-calculus.- A trace consistent subset of PTL.- Tutorial: Proving properties of concurrent systems with SPIN.- On sharing and determinacy in concurrent systems.- Process semantics of graph reduction.- Bisimulations for a calculus of broadcasting systems.- Delayed choice for process algebra with abstraction.- CTR: A calculus of timed refinement.- Temporal logic + timed automata: Expressiveness and decidability.