04269nmm a2200361 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002800139245017100167250001700338260006300355300003100418505095700449505096101406505037502367653003602742653005102778653004902829653001402878653002602892653003602918653001902954710003402973041001903007989003803026490003803064856006803102082001303170520072403183EB000655948EBX0100000000000000050903000000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835404473821 aSmolka, Scotte[editor]00aCONCUR '95 Concurrency TheoryhElektronische Ressourceb6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedingscedited by Scott Smolka a1st ed. 1995 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1995, 1995 aXI, 553 pbonline resource0 aWill 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 -- 0 aLocal 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 -- 0 aTutorial: 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 aComputation by Abstract Devices aProgramming Languages, Compilers, Interpreters aProgramming languages (Electronic computers) aComputers aTheory of Computation aLogics and Meanings of Programs aComputer logic2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/3-540-60218-6?nosfx=yxVerlag3Volltext0 a004.0151 aThis book constitutes the proceedings of the 6th International Conference on Concurrency Theory, CONCUR '95, held in Philadelphia, Pennsylvania in August 1995. The volume presents seven invited contributions by outstanding researchers and 33 refereed full research papers selected by the program committee out of a total of 91 submissions. The collection of articles gives a representative overview on what happened in this area of research, since the last CONCUR conference took place. There are sections on model checking, mobile processes, process theory, true concurrency, process algebra, probabilistic automata, real-time systems, testing semantics, decidability results, refinement theory, and linear-time logics