000 04053nam a22005775i 4500
001 978-3-540-69188-4
003 DE-He213
005 20160624102054.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540691884
_9978-3-540-69188-4
024 7 _a10.1007/3-540-63141-0
_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 '97: Concurrency Theory
_h[electronic resource] :
_b8th International Conference Warsaw, Poland, July 1–4, 1997 Proceedings /
_cedited by Antoni Mazurkiewicz, Józef Winkowski.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aVIII, 428 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 ;
_v1243
505 0 _aRecent developments in the mathematics of reactive systems (extended abstract) -- Partial-order reduction in the weak modal mu-calculus -- Cyclic vector languages -- A product version of dynamic linear time temporal logic -- Reasoning about cryptographic protocols in the spi calculus -- Modularity for timed and hybrid systems -- A universal reactive machine -- Bounded stacks, bags and queues -- Adding partial orders to linear temporal logic -- Reachability analysis of pushdown automata: Application to model-checking -- Synthesis of nets with inhibitor arcs -- An algebraic theory of multiple clocks -- Horizontal and vertical structuring techniques for statecharts -- Implicit typing à la ML for the join-calculus -- Proving safety properties of infinite state systems by compilation into Presburger arithmetic -- Axiomatizing flat iteration -- Probabilistic concurrent constraint programming -- On the complexity of verifying concurrent transition systems -- Fair simulation -- High level expressions with their SOS semantics -- How to Parallelize sequential processes -- Causal ambiguity and partial orders in event structures -- Model checking PA-processes -- Bisimulation and propositional intuitionistic logic -- A rigorous analysis of concurrent operations on B-trees -- First-order axioms for asynchrony -- On implementations and semantics of a concurrent programming language -- Algebraic characterization of petri net pomset semantics.
520 _aThis book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997. The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
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.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Communication Networks.
700 1 _aMazurkiewicz, Antoni.
_eeditor.
700 1 _aWinkowski, Józef.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540631415
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1243
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-63141-0
942 _2EBK7159
_cEBK
999 _c36453
_d36453