000 04887nam a22005415i 4500
001 978-3-540-44738-2
003 DE-He213
005 20160624101952.0
007 cr nn 008mamaa
008 121227s1995 gw | s |||| 0|eng d
020 _a9783540447382
_9978-3-540-44738-2
024 7 _a10.1007/3-540-60218-6
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aCONCUR '95: Concurrency Theory
_h[electronic resource] :
_b6th International Conference Philadelphia, PA, USA, August 21–24, 1995 Proceedings /
_cedited by Insup Lee, Scott A. Smolka.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
300 _aXI, 553 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v962
505 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 -- 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.
520 _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.
650 0 _aComputer science.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aLee, Insup.
_eeditor.
700 1 _aSmolka, Scott A.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540602187
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v962
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-60218-6
942 _2EBK4984
_cEBK
999 _c34278
_d34278