A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Furthermore, T allows us to simulate truly concurrent CSP within the framework of standard interleaving CSP. ... T gives rise to a coordination environment that simulates the truly concurrent version of a CSP coordination process at runtime and starts a user-defined function (UDF) after performing the start event ...doi:10.1007/978-3-642-21464-6_5 fatcat:pakttjm4kjhprmdifmx346bada
In this paper, we focus on concurrent systems modeled as Communicating Sequential Processes (CSP) and show their refinements can be validated using insights from translation validation, automated theorem ... Therefore, checking if a system, modeled as a set of concurrent processes, is a refinement of another is of tremendous value. ... In this paper we present a new trace refinement checking algorithm for concurrent systems modeled as CSP programs. Our algorithm uses a simulation relation approach to proving refinement. ...doi:10.1109/iccad.2007.4397284 dblp:conf/iccad/KunduLG07 fatcat:jjq7nxqfivfhlhucqbspqexdka
CSP). ... The paper does not satisfy the requirements to be a truly original ar- ticle. ...
Large threaded programs are known to be difficult to implement correctly, comprehend, and maintain, while concurrent programs written in process algebraic paradigms of concurrency, such as communicating ... Threading has become the dominant paradigm of concurrent computation in the most popular programming languages. ... Lee speculates that as multicore and heterogeneous multiprocessor architectures become more common, formerly correctly-behaving software will fail due to the greater opportunities for truly concurrent ...doi:10.1109/scam.2009.10 dblp:conf/scam/LangeM09 fatcat:67fb4gzykbbytcrb64kpxzx4uu
This is an investigation into the methodology of some theories of concurrency, trace theory, CCS, CSP, ACP, but mainly devoted to CCS and CSP. ... (English summary) Concurrency theory and applications 96 (Kyoto). Strikaisekikenkytisho Kokytroku No. 996 (1997), 111-124. Summary: “We propose a new truly-concurrent semantics for the z-calculus. ...
Evaluation results indicate that our truly distributed constraint solver works well within the observed limitations when tested with various distributed CSPs. ... Particularly, we discuss design and implementation issues related to truly distributed constraint solver which might not be critical when simulated on a single machine. ... Distribution of CSPs across multiple machines, rather than simulation on a single machine, requires the development of a distributed system. ...arXiv:1509.01040v1 fatcat:klbub3vhcvcuxlgnsjc4daoqni
Models like Petri nets and event structures represent concurrent activity in terms of causal independence while most other models simulate concurrency by nondeterministic interleaving of atomic actions ... Hoare’s ‘commu- nicating sequential process’ (CSP). ...
DAIMI Report Series
As a result we automatically obtain a truly concurrent semantics for CCS. (work by G. Ferrari, R. Gorrieri and U. ... We furthermore have to introduce the concept of a truly distributed execution in such semantics. ...doi:10.7146/dpb.v21i392.6627 fatcat:z7kwdje4ebdkrmvhynaomrvqu4
ISBN 3-88457-095-1 The authors provide formal results about the relationship between the interleaving semantics and the partial order semantics for both Petri nets and concurrent programs (CSP, and shared ... The ability to put large amounts of processing power on a single chip promises to make sophisticated data compression algorithms truly practical. ...
For the first time, we show its use in combination with a commercial-off-the-shelf simulation package (CSP), namely the simulation system SLX. ... While it has been shown that HLA is applicable for connecting commercial off-the-shelf simulation packages (CSPs), the usage of HLA time management in this application area is virtually always limited ... This execution environment represents a realistic working environment when interoperability between two or more CSPs is intended, as those are not typically executed in a truly distributed environment ...doi:10.1109/wsc.2015.7408290 dblp:conf/wsc/Strassburger15 fatcat:loc2r34lj5fyjkuutpko4jtn6e
Most of the ideas presented can be directly applied to other concurrent specification languages such as Promela or CCS, but we center the discussion and the implementation on CSP. ... difficulties such as heavy concurrency and non-determinism, synchronizations, frequent absence of data dependence, etc. ... In particular, with Erlang we can use truly concurrent processes to implement interleaving and synchronized parallelism. Figure 7 summarizes the internal architecture of CSP-Tracker. ...doi:10.1016/j.parco.2016.01.006 fatcat:hia6njkdnffrfg2s2ki6ezuo4e
internal communication mechanism between process nodes is designed to smooth the execution of behaviors in a CSP system. ... the scale of current systems become larger and larger and their complexity is increasing gradually, research on executable models in the design phase becomes significantly important as it is helpful to simulate ... In addition, not only can CSP capture the dynamic state of a system, but also can describe concurrent systems, which is utilized to reason about systems biology, communication protocols, and business logic ...doi:10.23919/jsee.2021.000077 fatcat:zww43upozvh3xoq2vcoknul27a
In order to determine the real cost of the rented CPU resources, we experimented with different number of concurrent messages with different sizes. ... can truly maximize resource utilization and minimize their operating costs  . ... In order to simulate realistic occasions of renting different amount of resources, we prepared the cloud testing environments following the CSPs' pricing models presented in Tables 1 and 2, for Windows ...doi:10.2498/cit.1002191 fatcat:a5yifotjrffflmex7naypr2lhq
G.H.Hilderink / A Graphical Modeling Language for Specifying Concurrency based on CSP G.H.Hilderink / A Graphical Modeling Language for Specifying Concurrency based on CSP 257 model by the designer. ... Introduced in this paper is a new graphical modeling language for specifying concurrency in software designs. The language notations are derived from CSP and the resulting designs form CSP diagrams. ... A CSP diagram can be mathematically analyzed, checked, simulated, and finally executed on a dedicated embedded real-time system. ...doi:10.1049/ip-sen:20030132 fatcat:klotjdpksbbc7bhk4qsbd2uux4
In complex medium, exogenous XIP does not induce comX, whereas CSP elicits a bimodal comX response from the population. ... In a chemically defined medium, exogenous CSP does not induce comX, whereas exogenous XIP elicits a comX response from all cells. ... However, this was not the case in the flow system, which raises the question of whether extracellular XIP is truly necessary for comX to respond to CSP. ...doi:10.1111/j.1365-2958.2012.08187.x pmid:22845615 pmcid:PMC3468698 fatcat:zkqynuenwvenzlhilh4fqqdjnm
« Previous Showing results 1 — 15 out of 811 results