Titlebook: Semantics of Systems of Concurrent Processes; LITP Spring School o Irène Guessarian Conference proceedings 1990 Springer-Verlag Berlin Heid

Tamoxifen

书目名称Semantics of Systems of Concurrent Processes影响因子(影响力)




书目名称Semantics of Systems of Concurrent Processes影响因子(影响力)学科排名




书目名称Semantics of Systems of Concurrent Processes网络公开度




书目名称Semantics of Systems of Concurrent Processes网络公开度学科排名




书目名称Semantics of Systems of Concurrent Processes被引频次




书目名称Semantics of Systems of Concurrent Processes被引频次学科排名




书目名称Semantics of Systems of Concurrent Processes年度引用




书目名称Semantics of Systems of Concurrent Processes年度引用学科排名




书目名称Semantics of Systems of Concurrent Processes读者反馈




书目名称Semantics of Systems of Concurrent Processes读者反馈学科排名

carotid-bruit

CCS and petri nets, for CCS. Two approaches are considered: a compositional approach where semantic operations are defined for Petri nets explicitly, and an operational approach using Plotkin-style transition rules which is particularly convenient for infinite processes. It is discussed which class of CCS programs is representable by finite nets.

hematuria

Conference proceedings 1990, traces, CCS and Petri nets, and categorical models. They also cover and compare the various notions of observation and bisimulation equivalences, logics for concurrency, and applications to dis- tributed systems.

Felicitous

0302-9743 languages, traces, CCS and Petri nets, and categorical models. They also cover and compare the various notions of observation and bisimulation equivalences, logics for concurrency, and applications to dis- tributed systems.978-3-540-53479-2978-3-540-46897-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

Capture

Fault-tolerant naming and mutual exclusion,n as a separate segment, whose address (necessary to access it) is "hidden". A process must reconstruct this address before entering its critical section, involving the cooperation of a number of other processes..For the two problems, protocols are given and their complexity is estimated.

Digest

CHAR

Tractable

DEI

Metric pomset semantics for a concurrent language with recursion,tional and denotational semantics for the considered language are provided and their equivalence is established by showing that both are fixed points of a contracting higher order operator. In a final section we give a tentative denotational semantics for an extension of the language with synchronization.

landmark

Equivalences and refinement,rove that “linear time” partial order semantics, where causality in runs is explicit, is invariant under refinement. Finally, we consider various bisimulation equivalences based on partial orders and show that the strongest one of them is preserved by refinement whereas the others are not.