Filters








2,426 Hits in 3.8 sec

A theory for nondeterminism, parallelism, communication, and concurrency

Manfred Broy
1986 Theoretical Computer Science  
So the language allows to treat the basic semantic notions of nondeterminism, parallelism, communication, and concurrency for multiprogramming in a completely formal, applicative framework.  ...  In particular, it provides a semantic theory for networks of loosely coupled, nondeterministic, communicating, stream processing functions.  ...  A theory for nondeterminism, parallelism, communication, and concurrency 7 The domain For the notions complete partial order, algebraic domain, montonoic and continuous, see e.g.  ... 
doi:10.1016/0304-3975(86)90040-x fatcat:deaevefkgrc2nkg4qbcahq2bca

Special issue on "Combining Compositionality and Concurrency": part 1

Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog
2014 Acta Informatica  
One the one hand, a theory of concurrency was initiated by Carl Adam Petri, with notions like causality, conflict, and concurrency.  ...  One the other hand, a theory of communicating processes was developed by Robin Milner and Tony Hoare, where the emphasis was put on composing processes by algebraic operators like sequential, nondeterministic  ...  One the one hand, a theory of concurrency was initiated by Carl Adam Petri, with notions like causality, conflict, and concurrency.  ... 
doi:10.1007/s00236-014-0213-y fatcat:qgg42adr6fhbjddp2mnifapuuy

Page 476 of Mathematical Reviews Vol. , Issue 94a [page]

1994 Mathematical Reviews  
The book contains some important developments in the understanding of concurrent processes and it is warmly rec- ommended to researchers in the theory of parallel computation.  ...  Action refinement may be used to give a complete characterization of a model of concurrent computation based on partial orders, the series-parallel pomset of Pratt and Gisher.  ... 

Evolution of distributed computing theory

Michael J. Fischer
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
Topics ranged from parallel algorithms, concurrency control in database systems, communication mechanisms, real-time systems, semantics of concurrency, and more.  ...  of Distributed Computing Characteristic Elements of Distributed Computing Theory Conclusion Communication mechanisms Synchrony, nondeterminism, and timing Scheduling and fairness Dealing with uncertainty  ... 
doi:10.1145/1400751.1400858 dblp:conf/podc/Fischer08 fatcat:ospmit6o2jfbnos53f7zvpl4n4

19th International Conference on Concurrency Theory

Franck van Breugel, Marsha Chechik
2010 Information and Computation  
Topics include basic models of concurrency, logics for concurrency, models of specialized concurrent systems, verification and analysis techniques for concurrent systems, and related concurrent programming  ...  Its "sequential" subclass is called BPA (short for basic process algebra) and its "parallel" subclass is called BPP (short for basic parallel processes).  ...  The problem of constructing a winning strategy for such games is essential for applications like controller synthesis or counterexample-guided abstraction refinement.  ... 
doi:10.1016/j.ic.2010.05.003 fatcat:kj5lscvkovfqfneyfrfqs5icje

Page 2878 of Mathematical Reviews Vol. , Issue 84g [page]

1984 Mathematical Reviews  
We are concerned with three fundamental notions in this field: parallel composition, synchronization, and communication, and we develop a general framework in which 84g:68008  ...  He then defines a continuous denotational semantics for unbounded nondeterminism.  ... 

The Problem with Threads

E.A. Lee
2006 Computer  
Tech), and Mark Miller.  ...  Acknowledgments I acknowledge the thought-provoking comments and suggestions from Joe Buck (Synopsys), Mike Burrows (Google), Stephen Edwards (Columbia), Jim Larus (Microsoft), Sandeep Shukla (Virginia  ...  CSP-like concurrent program, in which each component, represented by an icon, is a process, and communication is by rendezvous.  ... 
doi:10.1109/mc.2006.180 fatcat:2xr64ouajvd5flqceb7sfrrzq4

Page 1962 of Mathematical Reviews Vol. , Issue 80E [page]

1980 Mathematical Reviews  
{For the entire collection see MR 80d:68004.} Francez, Nissim; Hoare, C. A. R.; -s7a 80e:68028 Semantics of nondeterminism, concurrency and communication.  ...  The attempt is to provide a denotational semantics for communicating concurrent processes with nondeterminism. No shared variables are allowed and there are a few other minor restrictions.  ... 

Page 4270 of Mathematical Reviews Vol. , Issue 86i [page]

1986 Mathematical Reviews  
So the language allows us to treat the basic semantic notions of nondeterminism, parallelism, communication, and concurrency for multiprogramming in a com- pletely formal, applicative framework.  ...  {For the entire collection see MR 85m:68002.} COMPUTER SCIENCE 4270 Broy, Manfred (D-MUTU-D) Fixed point theory for communication and concurrency.  ... 

An algebra of concurrent non-deterministic processes

Ludmila A. Cherkasova, Vadim E. Kotov
1991 Theoretical Computer Science  
This paper illustrates how early ideas and simple naive concepts of concurrency theory of the 1960s have now turned into complex and subtle problems of modern calculi of concurrent processes.  ...  " semantics for processes, compositionality and full abstractness in the algebra, handling exceptional situations, etc.  ...  Each of these theories describes a process as a set of actions with the introduction of relations such as sequentiality, concurrency or nondeterminism. For the cases of "pure ).  ... 
doi:10.1016/0304-3975(91)90304-k fatcat:uvwsrd7t3nbuzogpidywpra5ri

The semantic foundations of concurrent constraint programming

Vijay A. Saraswat, Martin Rinard, Prakash Panangaden
1991 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '91  
Concurrent constraint programming [Sar89 ,SR90] is a simple and powerful model of concurrent computation based on the notions of store-as-constraint and process as information straint programming framework  ...  Indeed, the origins of the cc framework are in concurrent logic programming and in the notion of constraint logic programing intro. duced by [JL87,Mah8~. See [Sar89] for further details.  ...  Very nat- ural definitions of parallel composition, communication and hiding are given.  ... 
doi:10.1145/99583.99627 dblp:conf/popl/SaraswatRP91 fatcat:2t2lyephjjfkdfwfoj23z646fq

Page 6671 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
Typical combinators are don’t know and don’t care nondeterminism, recursion, parallelism, and restriction.  ...  In particular, first the work on constraint systems is considered: this involves the use of al- gebraic techniques, or techniques based on category theory, and also a proof-theory approach.  ... 

Page 4649 of Mathematical Reviews Vol. , Issue 85j [page]

1985 Mathematical Reviews  
Results include showing that jumps add power that cannot be compensated for by nondeterminism and more heads.  ...  4649 Authors’ summary: “We investigate the relative power of jumps, nondeterminism, and number of heads for real-time finite autom- ata.  ... 

Design for testability of protocols based on formal specifications [chapter]

Myungchul Kim, Samuel T. Chanson, Sangjo Yoo
1996 Protocol Test Systems VIII  
Communication protocols are inherently distributed and concurrent.  ...  of an implementation under test (IUT) following a formal specification, • Ability to handle both sequential and concurrent specifications, and • Provision of a mechanism for error location.  ...  Future work includes techniques for data level design for testability (so that we can pinpoint the cause of an error), and the theory and tools to test concurrent modules.  ... 
doi:10.1007/978-0-387-34988-6_16 fatcat:a5vvyvabszak7ah4bzmdxuzf64

Application-Aware Byzantine Fault Tolerance

Wenbing Zhao
2014 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing  
Application-aware Byzantine fault tolerance makes it possible to facilitate concurrent processing of requests, to minimize the use of Byzantine agreement, and to identify and control replica nondeterminism  ...  We elaborate the need for exploiting application semantics for Byzantine fault tolerance and the benefits of doing so, provide a classification of various approaches to application-aware Byzantine fault  ...  In [9] , a classification of replica nondeterminism beyond simple wrappable types is provided and a set of mechanisms for controlling replica nondeterminism is presented.  ... 
doi:10.1109/dasc.2014.17 dblp:conf/dasc/Zhao14 fatcat:vf6qbzcmijgwba7dc5dvqqja2q
« Previous Showing results 1 — 15 out of 2,426 results