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

用手捏

A multiset semantics for the pi-calculus with replication,A multiset (or Petri net) semantics is defined for the .-calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics.

DAMP

CHARM

https://doi.org/10.1007/3-540-57208-2Automata; Automaten; CONCUR‘93; Concurrency; Parallelism; Program Verification; Programmiersemantik; Progra

irreducible

978-3-540-57208-4Springer-Verlag Berlin Heidelberg 1993

APEX

Daniel Villarreal,Ronald H. Freemanimplified before verifying that it satisfies a temporal logic formula. Most previous work on this problem is based on property-preserving mappings between transition systems. The results presented here allow direct simplification of process terms for some important classes of temporal properties.

Panther

Daniel Villarreal,Ronald H. Freemanram development the CCL rule cannot be derived from simpler ones. Within a non-modular set-up the CCL rule can be . however from a simpler independence rule and an analog of the expansion rule for process algebras.

giggle

孤独无助

Conscientious

https://doi.org/10.1007/978-3-476-03524-0 a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion of ‘activation’ channel which we christen .. is the name of a new internal action which i

散开

,Naturproduktivität und Wirtschaftsprozeß,valences, ∼ is preserved by name substitution and (hence) by input prefix. The differences among all these equivalences already appear in the sublanguage without restriction: Here the definition of ∼ can be factorised into a “standard” part which, modulo the different syntax of actions, is the CCS b