Titlebook: Concurrency, Compositionality, and Correctness; Essays in Honor of W Dennis Dams,Ulrich Hannemann,Martin Steffen Book 2010 The Editor(s) (i

名义上

On the Power of Play-Out for Scenario-Based Programs,nd limitations. Specifically, we define a simple infinite hierarchy of LSC programs, and use it to show that smart play-out, the lookahead version of play-out guided by model-checking, is strictly weaker than full synthesis from LSC.

陶醉

可以任性

Meanings of Model Checking, the term model checking has acquired slightly different shades of meaning. In this paper we these consider variant aspects of model checking, elucidating some often overlooked and subtle distinctions.

僵硬

,Smaller Abstractions for ∀CTL* without Next,sensitive to finite stuttering. We exploit these results by introducing a safe . that is typically smaller than the usual functional one while at the same time more precise, i.e., it has less spurious counter-examples.

cauda-equina

Oleksiy V. Kapustyan,Iryna V. Romaniukerations, events and behaviours in the light of their mereologies. entities. We end the paper with some speculations on the rôle of Galois connections in the study of compositionality and domain mereology.

单色

向宇宙

Lecture Notes in Mechanical Engineeringence relation, introduced by the denotational semantics, given by Tony Hoare for a process algebra like Communicating Sequential Processes (CSP), based on so-called readiness, refusal and failure concepts. In this little note we analyze the question whether the equivalence relation, introduced by denotational semantics is in fact a bisimulation.

Adulate

Kuo-Ming Chao,Lihong Jiang,Xiang Feinces differ by too much. Experimental support for this view comes from the measured behavior of a test chip called “Infinity” built by Sun Microsystems in 90 nanometer CMOS circuits fabricated at TSMC.

bronchodilator

法律

Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence,ence relation, introduced by the denotational semantics, given by Tony Hoare for a process algebra like Communicating Sequential Processes (CSP), based on so-called readiness, refusal and failure concepts. In this little note we analyze the question whether the equivalence relation, introduced by denotational semantics is in fact a bisimulation.