Thông tin chi tiết

Dạng tài liệu:	Bản in
Chỉ số ISBN:	3-540-53048-7
Ngôn ngữ:	eng
Mã giá:	68BA
Mã MSC:	Đang cập nhật ...
Tác giả:	Baeten, J. C. M.(ed.), Klop, J. W.(ed.)
Nhan đề:	CONCUR '90
Lần xuất bản:	1
Xuất bản, phát hành:	H : Berlin , 1990
Số trang:	536;
Kích thước:	24 cm
Từ Khóa:	Amsterdam (The Netherlands) , CONCUR '90 , concurrent systems , Proceedings , process algebra , process specifications , processes , semantics of concurrent programs
Bộ sách:	Lecture Notes in Computer Science. 458.

• Xem biểu ghi Marc

  Thông tin dữ liệu

  ×

  020	##	$a3-540-53048-7
  024	1#	$a91g:68003 $d0746.68005
  041	##	$aeng
  084	##	$a68BA
  090	##	$cLv2264
  100	1#	$aBaeten, J. C. M.(ed.)
  245	##	$aCONCUR '90
  246	##	$aTheories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings.
  250	##	$a1
  260	##	$aH:$bBerlin,$c1990
  300	##	$a536;$c24 cm
  505	0#	$aE. Best Partial order semantics of concurrent programs (abstract) R. Gorrieri, U. Montanari SCONE: a simple calculus of nets M. Hennessy Value-passing in process algebras (abstract) CAJR. Hoare Let's make models (abstract) K.G. Larsen Ideal specification formalism = expessivity + compositionality + decidability testability + SELECTED PRESENTATIONS: M. Abadi An axiomatization of Lamport's temporal logic of actions A. Arora, P. Attie, A. Evangelist, M. Gouda Convergence of iteration systems J.CM. Baeten, JA. Bergstra Pirocess algebra with a zero object F.S. de Boer, C. Palamidessi On the asynchronous nature of communication in concurrent logic languages: a fully abstract model based on sequences J. Bradfield, C. Stirling Verifying temporal properties of processes I, Christoff Testing equivalences and fully abstract models for probabilistic processes R. Cleaveland, B. Steffen A preorder for partial process specifications R. De Nicola, U. Montanari, F. Vaandrager Back and forth bisimulations J.Desel Reduction and design of well-behaved concunent systems J. Espana Synthesis roles for Petri nets, and how they lead to new results A. Fekete, N. Lynch The need for headers: an impossibility result for communication over unreliable channels Y. Feng, J. Liu A temporal approach ID algebraic specifications N. Francez, IR. Forman Superimposition for inteiacting processes L. Fredlund, B. Jonsson, J. Parrow An implementation of a translational semantics for an imperative language R. Gerber, I. Lee CCSR: a calculus for communicating shared resources RJ. van Glabbeek The linear time - branching time spectrum Ef. Gribomont A progiamming logic for formal concurrent systems J.F. Groote A new strategy for proving tO-completeness applied to process algebra J.F. Groote Transition system specifications with negative premises MB. Josephs, J. T. Udding Delay-insensitive circuits: an algebraic approach to their design C.C. Jou, sn. Smolka Equivalences, congruences, and complete axiomatizations for probabilistic processes J. Meseguer Rewriting as a unified model of concurrency F. Mailer, C. Tofts A temporal calculus of communicating systems P. Pdczkowski Proving termination of communicating programs H. Qin, P. Lewis Factorization of finite state machines under observational equivalence A. Sinachopoulos Partial order logics for elementary net systems: state- and event-approaches Sd. Smolka, B. Steffen Priority as extremal probability C. Tofts A synchronous calculus of relative frequency G. Winskel On the compositional checking of validity W. Yi Real-time behaviour of asynchronous agents S. YOCCOI Effective solutions to domain equations: an approach to effective denotational semantics Author index
  520	##	$aKhông có tóm tắt.
  653	##	$aAmsterdam (The Netherlands)
  653	##	$aCONCUR '90
  653	##	$aconcurrent systems
  653	##	$aProceedings
  653	##	$aprocess algebra
  653	##	$aprocess specifications
  653	##	$aprocesses
  653	##	$asemantics of concurrent programs
  700	1#	$aKlop, J. W.(ed.)
  773	0#	$tLecture Notes in Computer Science. 458.
  900	##	1
  911	##	ELIB
  912	##	Converted
  927	##	Sách, chuyên khảo, tuyển tập

  Đóng

  Số liệu bổ sung

  ×