CONCUR '95 - Concurrency Theory : 6th International Conference, Philadelphia, PA, USA, August 1995 - Proceedings - used book

EAN (ISBN-13): 9783540602187
ISBN (ISBN-10): 3540602186
Hardcover
Paperback
Publishing year: 1995
Publisher: Springer Berlin
564 Pages
Weight: 0,842 kg
Language: eng/Englisch

Book in our database since 2008-04-21T14:12:00+01:00 (London)
Detail page last modified on 2024-03-31T09:32:42+01:00 (London)
ISBN/EAN: 9783540602187

ISBN - alternate spelling:
3-540-60218-6, 978-3-540-60218-7
Alternate spelling and related search-keywords:
Book author: proceedings, scott, smolka
Book title: august 6th, proceedings the 6th international conference, concurrency, philadelphia usa, conferences proceedings, notes, analytical mechanics, august 1995, nonlinear control mechanics

---

Information from Publisher

Author: Scott Smolka
Title: Lecture Notes in Computer Science; CONCUR '95 Concurrency Theory - 6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings
Publisher: Springer; Springer Berlin
553 Pages
Publishing year: 1995-09-09
Berlin; Heidelberg; DE
Language: English
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 553 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Concurrency; Echtzeitsysteme; Mobile Processes; Mobile Prozesse; Model Checkcing; Modellprüfung; Nebenläufigkeit; Program Semantics; Programmsemantik; Real-Time Systems; calculus; complexity; logic; Theory of Computation; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Compiler und Übersetzer; EA

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 modelchecking.- 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.