CONCUR '95: Concurrency Theory (Record no. 34278)

000 -LEADER
fixed length control field 04887nam a22005415i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540447382
-- 978-3-540-44738-2
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1015113
245 10 - TITLE STATEMENT
Title CONCUR '95: Concurrency Theory
Sub Title 6th International Conference Philadelphia, PA, USA, August 21–24, 1995 Proceedings /
Statement of responsibility, etc edited by Insup Lee, Scott A. Smolka.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1995.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XI, 553 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic design.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Programming Languages, Compilers, Interpreters.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Lee, Insup.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Smolka, Scott A.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-60218-6
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1995.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK4984 http://dx.doi.org/10.1007/3-540-60218-6 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha