Titlebook: CONCUR ‘94: Concurrency Theory; 5th International Co Bengt Jonsson,Joachim Parrow Conference proceedings 1994 Springer-Verlag Berlin Heidel

新陈代谢

Regularity of BPA-Systems is Decidable,ive composition, sequential composition and guarded recursion. A system is regular if the interpretations of all process variables defined in the system have finitely many states. We present an effective method to transform a BPA specification into a linear specification whenever possible.

约会

熄灭

New Results on the Analysis of Concurrent Systems with an Indefinite Number of Processes,action, is suitable for modeling a number of resource-oriented problems in concurrency in which there is a unique control process (called the .) and an arbitrary number of identical user processes [13, 2]. Communication between processes is via synchronous actions in the style of Milner’s Calculus o

骗子

不规则

Outspoken

Local Model Checking for Parallel Compositions of Context-Free Processes, context-free form (or even a more general one). But the parallel composition of such systems introduces undecidabilities. Nevertheless, several instances can be handled as it is shown in this paper. The known model check techniques prove to be not extendable to parallel compositions. A new tableau

osculate

The Logical Structure of Concurrent Constraint Programming Languages (Abstract),e logic programming it claims close relations to logic. In fact these languages . logics in a certain sense that we make precise. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming languages forms a categorical structure called a hyperdoctrin

hauteur

temperate

SProc Categorically,traces. The significance of the work is twofold: It shows that the original presentation of . in mixed formulations is unnecessary — a simple categorical description exists. Furthermore, the techniques employed in the reconstruction suggest a general method of obtaining process categories with struc

破裂

From Timed Graphs to Hybrid Automata (Abstract),he hybrid automata as a model and specification language for hybrid systems. This is an extension of the traditional automata on infinite words in which the behavior of variables is governed in each state by a set of differential equations. Then we introduce the models of the timed automata and the