000 03847nam a22006015i 4500
001 978-3-540-46897-4
003 DE-He213
005 20160624102019.0
007 cr nn 008mamaa
008 121227s1990 gw | s |||| 0|eng d
020 _a9783540468974
_9978-3-540-46897-4
024 7 _a10.1007/3-540-53479-2
_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 _aSemantics of Systems of Concurrent Processes
_h[electronic resource] :
_bLITP Spring School on Theoretical Computer Science La Roche Posay, France, April 23–27, 1990 Proceedings /
_cedited by Irène Guessarian.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1990.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1990.
300 _aV, 457 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 ;
_v469
505 0 _aProcesses as data types: Observational semantics and logic -- Metric pomset semantics for a concurrent language with recursion -- Fault-tolerant naming and mutual exclusion -- Flow event structures and flow nets -- Three equivalent semantics for CCS -- Towards a semantic approach to SIMD architectures and their languages -- Concerning the size of clocks -- Transition systems with algebraic structure as models of computations -- Concurrency and computability -- Causal trees interleaving + causality -- Partially commutative formal power series -- Infinite traces -- Equivalences and refinement -- CCS and petri nets -- About fixpoints for concurrency -- Observers, experiments, and agents: A comprehensive approach to parallelism -- Action versus state based logics for transition systems -- Approaching fair computations by ultra metrics -- On distributed languages and models for distributed computation.
520 _aThis volume contains the proceedings of the 1990 Spring School of Theoretical Computer Science, devoted to the semantics of concurrency. The papers are of two kinds: - surveys and tutorials introducing the subject to novices and students and giving updates of the state of the art, - research papers presenting recent achievements in the semantics of concurrency. The contributions explicate the connections, similarities and differences between various approaches to the semantics of concurrency, such as pomsets and metric semantics, event structures, synchronization trees, fixpoints and languages, traces, CCS and Petri nets, and categorical models. They also cover and compare the various notions of observation and bisimulation equivalences, logics for concurrency, and applications to dis- tributed systems.
650 0 _aComputer science.
650 0 _aOperating systems (Computers).
650 0 _aLogic design.
650 0 _aDatabase management.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aOperating Systems.
650 2 4 _aProcessor Architectures.
650 2 4 _aDatabase Management.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aGuessarian, Irène.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540534792
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v469
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-53479-2
942 _2EBK5931
_cEBK
999 _c35225
_d35225