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

–DOX

爱好

Aids209

Axiomatizing flat iteration,of 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

慢慢啃

ANT

On the complexity of verifying concurrent transition systems,the program‘s implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurren

打火石

ANTE

多节

Reachability analysis of pushdown automata: Application to model-checking,ncorporate this procedure into the automata-theoretic approach to model-checking to define new model-checking algorithms for pushdown systems against both linear and branching-time properties. From these results we derive upper bounds for several model-checking problems as well as matching lower bounds.

要素

PHIL

A Comparison of FTZs in the World,chronously) cyclic? The question is of interest because many real-world systems are composed partially of cyclic sequential processes and have behaviour which is conceived of as being made up of transactions, which in our case are the asynchronous cycles.