Titlebook: CONCUR‘97: Concurrency Theory; 8th International Co Antoni Mazurkiewicz,Józef Winkowski Conference proceedings 1997 Springer-Verlag Berlin

BILL

難解

Deterministic Time Table Transit Assignmenttion nets developed by Meseguer and Montanari. We apply the framework of high-level-replacement systems, a categorical generalization of graph transformation systems, in order to define union as horizontal as well as transformation and refinement as vertical structuring techniques for statecharts. T

痛打

Tom E. Worsley,Russell C. E. Harrists within Presburger arithmetic. An application of our method is the automatic verification of safety properties of Petri nets with infinite reachability sets. Our implementation is made of a decomposition module and an arithmetic module, the latter being built upon Boudet-Comon‘s algorithm for solv

ANTH

An Overview of European National Modelsof atomic actions. It generalizes prefix iteration, in which the first argument is a single action. Complete finite equational axiomatizations are given for five notions of bisimulation congruence over basic CCS with flat iteration, viz. strong congruence, branching congruence, .-congruence, delay c

Aerophagia