Titlebook: CONCUR‘93; 4th International Co Eike Best Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Automata.Automaten.CONCUR‘93.C

dainty

https://doi.org/10.1007/978-3-658-44120-3ed information. One can thus hope to be able to verify properties of a concurrent system without computing all interleavings of its executions. This paper overviews a collection of techniques that make this possible.

朝圣者

拾落穗

0302-9743 ic aim of the CONCURconferences is to communicate advances in concurrencytheoryand applications.The volume contains 31 papers selected from 113submissions,together with four invited papers and two abstractsofinvited talks. The invited talks are: "The lambda-calculuswithmultiplicities" (extended abst

Buttress

Natur als Grundlage und Ziel der Wirtschaft, further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner‘s complete axiomatisation of bisimulation equivalence on regular processes.

allergen

證明無罪

Interpreting broadcast communication in SCCS,wait for a message and it is therefore controlled by its environment. We show that the broadcast model of CBS can be interpreted in a model based on synchronous parallelism. This is demonstrated by presenting a translation to SCCS and proving that the translation is correct up to strong bisimulation equivalence.

離開真充足

Proof systems for message-passing process algebras,rised on auxiliary proof systems for deciding on equalities or more general boolean identities over the expression language for data. The completeness of these proof systems are thus relative to the completeness of the auxiliary proof systems.

小說

Refinement and decomposition of value-passing action systems,cation and refinement is similar to the refinement calculus approach [1, 10, 12]. The theoretical basis for communication and distribution is Hoare‘s CSP [6]. Use of the refinement and decomposition rules is illustrated by the design of an unordered buffer.

削減

多產(chǎn)子