| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Semantics Of Programming Languages (F.3.2) > Process Models (F.3.2...)
|
|
 |
|
|
| |
|
|
| |
1-7 of 7
Reviews about "Process Models (F.3.2...)":
|
Date Reviewed |
| |
Dynamic multirole session types
Deniélou P., Yoshida N. ACM SIGPLAN Notices 46(1): 435-446, 2011. Type: Article
Session types have been introduced to provide global static descriptions of multi-process systems by specifying abstractions of the interaction patterns among a fixed set of participants. Deniélou and Yoshida’s paper...
|
Apr 7 2011 |
| |
Decidable first-order transition logics for PA-processes
Lugiez D., Schnoebelen P. Information and Computation 203(1): 75-113, 2005. Type: Article
In a previous paper [1], the authors showed, using tree automata, that the set of reachable states of a transition system generated by a PA-process is regular, and hence decidable. A PA-process is derived from the process calculus PA o...
|
Jun 26 2006 |
| |
Symbolic semantic rules for producing compact STGLAs from value passing process descriptions
Bernardo M. ACM Transactions on Computational Logic 5(3): 436-469, 2004. Type: Article
The subject matter of this paper falls into the area of process algebra, a well-known algebraic theoretic framework for modeling and reasoning about concurrent and communicating systems. In particular, this paper presents a class of mo...
|
Oct 21 2005 |
| |
Event-based operational semantics and a consistency result for real-time concurrent processes with action refinement
Sun X., Zhang W., Wu J. Journal of Computer Science and Technology 19(6): 828-839, 2004. Type: Article
An event-based operational semantics for a timed language of temporal ordering specifications (LOTOS)-like process algebra (http://wwwtios.cs.utwente.nl/lotos/) is introduced in this theoretical paper. The authors examine a language de...
|
Aug 3 2005 |
| |
Well-behaved flow event structures for parallel composition and action refinement
van Glabbeek R., Goltz U. Theoretical Computer Science 311(1-3): 463-478, 2004. Type: Article
Event structures are a basic model of computation introduced by Nielsen, Plotkin, and Winskel [1]....
|
Sep 29 2004 |
| |
CSP, partial automata, and coalgebras
Wolter U. Theoretical Computer Science 280(1-2): 3-34, 2002. Type: Article
Although the application of universal algebraic techniques, particularly coalgebras, to the study of processes is not new, this paper attempts to apply these techniques to one particular formalism, Hoare’s communicating sequ...
|
Dec 18 2002 |
| |
A tutorial on EMPA
Bernardo M., Gorrieri R. (ed) Theoretical Computer Science 202(1-2): 1-54, 1998. Type: Article
Process algebras are mathematical tools used to model and analyze a system in which more than one process occurs concurrently. In many real-world processes, priorities, probabilities, and the duration of an action need due emphasis. Pr...
|
Nov 1 1998 |
| |
|
|
| |
|
|
