000 | 04559nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-46395-5 | ||
003 | DE-He213 | ||
005 | 20160624102014.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1990 gw | s |||| 0|eng d | ||
020 |
_a9783540463955 _9978-3-540-46395-5 |
||
024 | 7 |
_a10.1007/BFb0039045 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aCONCUR '90 Theories of Concurrency: Unification and Extension _h[electronic resource] : _bAmsterdam, The Netherlands, August 27–30, 1990 Proceedings / _cedited by J. C. M. Baeten, J. W. Klop. |
246 | 3 | _aAmsterdam, The Netherlands, August 27-30, 1990. Proceedings | |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1990. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1990. |
|
300 |
_aX, 542 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 ; _v458 |
|
505 | 0 | _aPartial order semantics of concurrent programs -- SCONE: A simple calculus of nets -- Value-passing in process algebras -- Let's make models -- Ideal specification formalism = expressivity + compositionality + decidability + testability + ... -- An axiomatization of Lamport's temporal logic of actions -- Convergence of iteration systems -- Process algebra with a zero object -- On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences -- Verifying temporal properties of processes -- Testing equivalences and fully abstract models for probabilistic processes -- A preorder for partial process specifications -- Back and forth bisimulations -- Reduction and design of well-behaved concurrent systems -- Synthesis rules for Petri nets, and how they lead to new results -- The need for headers: An impossibility result for communication over unreliable channels -- A temporal approach to algebraic specifications -- Superimposition for interacting processes -- An implementation of a translational semantics for an imperative language -- CCSR: A calculus for communicating shared resources -- The linear time - branching time spectrum -- A programming logic for formal concurrent systems -- A new strategy for proving ?-completeness applied to process algebra -- Transition system specifications with negative premises -- Delay-insensitive circuits: An algebraic approach to their design -- Equivalences, congruences, and complete axiomatizations for probabilistic processes -- Rewriting as a unified model of concurrency -- A temporal calculus of communicating systems -- Proving termination of communicating programs -- Factorization of finite state machines under observational equivalence -- Partial order logics for elementary net systems: State- and event-approaches -- Priority as extremal probability -- A synchronous calculus of relative frequency -- On the compositional checking of validity -- Real-time behaviour of asynchronous agents -- Effective solutions to domain equations an approach to effective denotational semantics. | |
520 | _aThis volume gives the proceedings of the conference CONCUR '90. This is the first conference organized by ESPRIT Basic Research Action 3006, CONCUR (Theories of Concurrency: Unification and Extension), started in September 1989. The principal aims of the action are to explore the relationships among the different approaches to algebraic concurrency theory, and to develop a formalism applicable to a wide range of case studies. The articles in this volume describe the state of the art in concurrency, the theory of communicating concurrent (or distributed) systems. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
700 | 1 |
_aBaeten, J. C. M. _eeditor. |
|
700 | 1 |
_aKlop, J. W. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540530480 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v458 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0039045 |
942 |
_2EBK5769 _cEBK |
||
999 |
_c35063 _d35063 |