Results 211 to 220 of about 30,211 (267)
Robustness of quantum correlations in photonic systems under non-Markovian dephasing: theoretical analysis in the experimental range. [PDF]
Sci RepBerrada K, Bougouffa S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Discrete Event Dynamic Systems, 2006
Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers can ever find out that a trajectory of the system belongs to some secret. We search for a regular control on the system, enforcing the specified secrets on the observers, even ...
Éric Badouel +4 more
openaire +1 more source
Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers can ever find out that a trajectory of the system belongs to some secret. We search for a regular control on the system, enforcing the specified secrets on the observers, even ...
Éric Badouel +4 more
openaire +1 more source
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, 2001We study wait-free computation using (read/write) shared memory under a range of assumptions on the arrival pattern of processes. We distinguish first between bounded and infinite arrival patterns, and further distinguish these models by restricting the number of arrivals minus departures, the concurrency.
Eli Gafni +2 more
openaire +1 more source
Applied Categorical Structures, 2001
This article considers how S. Abramsky's interaction categories [\textit{S. Abramsky}, \textit{S. J. Gay} and \textit{R. Nagarajan}, ``Interaction categories and the foundation of typed concurrent programming'', in: Deductive program design, 35-115 (1996; Zbl 0842.00044)], can be usefully viewed as quantaloids. Quantaloids are categories enriched in \({
openaire +1 more source
This article considers how S. Abramsky's interaction categories [\textit{S. Abramsky}, \textit{S. J. Gay} and \textit{R. Nagarajan}, ``Interaction categories and the foundation of typed concurrent programming'', in: Deductive program design, 35-115 (1996; Zbl 0842.00044)], can be usefully viewed as quantaloids. Quantaloids are categories enriched in \({
openaire +1 more source
Concurrent C++: Concurrent programming with class(es)
Software: Practice and Experience, 1988AbstractC++ and Concurrent C are both upward‐compatible supersets of C that provide data abstraction and parallel programming facilities, respectively. Although data abstraction facilities are important for writing concurrent programs, we did not provide data abstraction facilities in Concurrent C because we did not want to duplicate the C++ research ...
Narain H. Gehani, William D. Roome
openaire +1 more source