Results 291 to 300 of about 331,242 (341)
Some of the next articles are maybe not open access.
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 ...
E. 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 ...
E. Badouel +4 more
openaire +1 more source
ACM Computing Surveys, 1996
Concurrency theory is concerned with the modeling and verification of concurrent systems, while concurrency practice promulgates the application of concurrency theory to concurrent systems of practical interest. We assert that a strong interplay between concurrency theory and practice is essential for the continued development of both fields.
De Nicola, Rocco, Smolka, Scott A.
openaire +3 more sources
Concurrency theory is concerned with the modeling and verification of concurrent systems, while concurrency practice promulgates the application of concurrency theory to concurrent systems of practical interest. We assert that a strong interplay between concurrency theory and practice is essential for the continued development of both fields.
De Nicola, Rocco, Smolka, Scott A.
openaire +3 more sources
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 ...
Gehani, N. H., Roome, W. D.
openaire +1 more source
Concurrency and Concurrent Constraint Programming
1995The intent of this paper is to provide the basic ideas and the possible alternatives underlying the task of giving a semantics to a concurrent system/language, and to describe a particular approach which makes some specific choices in order to give a semantics to the class of CC languages.
U. Montanari, ROSSI, FRANCESCA
openaire +2 more sources
Public Works Management & Policy, 1997
Concurrency is an infrastructure finance and growth management policy implemented by local government. It is a policy designed to match public facilities and private development. When implemented, concurrency policy withholds land development approval unless selectedfacilities and services exist in accordance with locally adopted level of service ...
openaire +2 more sources
Concurrency is an infrastructure finance and growth management policy implemented by local government. It is a policy designed to match public facilities and private development. When implemented, concurrency policy withholds land development approval unless selectedfacilities and services exist in accordance with locally adopted level of service ...
openaire +2 more sources
Regime de concurrence et concurrence de regimes
Revue économique, 1952Sauvy Alfred. Régime de concurrence et concurrence de régimes. In: Revue économique, volume 3, n°6, 1952. pp. 769-784.
openaire +2 more sources
2011
This chapter presents purely combinatorial results that are needed for the proof of Statement G. The motivation for these results comes from the appearance of divisibility conditions through the factor δn(Σ; α) defined in (15.2) that appears in Theorems 15.3 and 15.4. According to Statement F, the sum of Λsubscript Greek capital letter gamma(α, σ)
Ben Brubaker +2 more
openaire +1 more source
This chapter presents purely combinatorial results that are needed for the proof of Statement G. The motivation for these results comes from the appearance of divisibility conditions through the factor δn(Σ; α) defined in (15.2) that appears in Theorems 15.3 and 15.4. According to Statement F, the sum of Λsubscript Greek capital letter gamma(α, σ)
Ben Brubaker +2 more
openaire +1 more source