J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Model Checking for the Concurrent Constraint Paradigm - Garcia (Correct)
....on shared variables, synchronous systems, reactive systems, timed systems, mobile systems or secure systems. There are many models for concurrent systems. Some examples of synchronous models are the process calculi of Milner s CCS [Mil89] Hoare s CSP [Hoa85] or the ACP of Bergstra and Klop [BK85] The model which we consider in this thesis is the model for concurrency that was de ned in [Sar89] The Concurrent Constraint programming paradigm (cc) was de ned by Saraswat and Rinard in [Sar89, Sar93, SR90] as a simple and powerful model of concurrent computation. In such computational ....
J.A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77-121, 1985.
Unknown - Ya--- Fi Mu (2002) (Correct)
....etc. However, there are also some classes that not in C. For example, Basic Parallel Processes [Chr93] are not in C, because they are not closed under synchronization (condition 3) Pushdown automata are not in C, because they are not closed under parallel composition (condition 2) PA processes [BK85] are not in C, because they are not closed under synchronization and because their transition rules are not injective (they do not satisfy conditions 1 and 3) # is (isomorphic to) A comp(T M 1 TM 2 ) Proof. Follows immediately from condition 1 (which enables efficient renaming of ....
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77--121, 1985.
An Algebraic Framework for Urgency - Ebastien Bornot And (1998) (11 citations) (Correct)
....transition relation is the union of the untimed transition relations of the combined timed transitions. The resulting time step relation is the intersection of the time step relations of the combined timed transitions. We introduce standard process algebra notation to represent timed systems [BK85] A discrete labeled transition system (S; A) can be represented as a set of equations of the form s = i2I a i :s i where f(s; a i ; s i )g i2I is the set of all the transitions issued from s 2 S and the right hand sides of the equations are terms p of the form, p : N il j s 2 S j a:p j p ....
J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, May 1985. Fundamental studies.
On the Composition of Hybrid Systems - Ebastien Bornot And (1997) (Correct)
.... transitions but may differ in urgency (ability to perform actions within a given delay) We assume that parallel composition of two discrete systems can be expressed as the non deterministic choice of terms starting with interleaving or synchronization actions (by means of some expansion theorem [BK85] The expansion theorem is extended to hybrid actions in the following manner : To guarantee maximal progress, non deterministic choice is replaced by priority choice that gives higher priority to synchronization actions over interleaving actions. Synchronization operators between ....
....composition of untimed terms. For this, we suppose that the vocabulary of actions A contains a distinguished element and consider the set A p of the words generated from A with a commutative operator such that for all a, a p = The operator is usually called communication function [BK85] The words are used to represent synchronization actions that is, actions that result from the synchronous occurrence of atomic actions. a 1 a 2 = means impossibility of synchronization. In the sequel, we suppose that there are no other simplification rules for but the rule for and ....
J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, May 1985. Fundamental studies.
Two Finite Specifications of a Queue Marc Bezem - Alban Ponse Utrecht (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, 1985.
Process Communication Environment - Damas Gruska Andrea (1993) (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of Communicating Processes with Abstraction. Theoretical Computer Science, 37, pp. 77- 21, 1985.
Symbolic Bisimulation Checking and Decomposition of Real-Time.. - Nakata (1997) (Correct)
No context found.
J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoret. Comput. Sci., 37:77--121, 1985.
Timed Network Semantics for Communicating Processes - Damas Gruska Andrea (1994) (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of Communicating Processes with Abstraction. Theoretical Computer Science, 37, pp. 77- 21, 1985.
Analysing the BKE-security protocol with μCRL - Groote, Mauw, Serebrenik (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science 37(1):77--121, 1985.
An Observational Model for Spatial Logics - Tuosto, Vieira (2004) (Correct)
No context found.
J. Bergstra and J. Klop. Algebra of communicating processes with abstraction. Theoretical Computuper Science, 37:77--121, 1985.
More Infinite Results - Burkart, Esparza (1997) (6 citations) (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of Communicating Processes with Abstraction. Theoretical Computer Science, 37:77--121, 1985.
Transition systems, link graphs and Petri nets - Leifer, Milner (2004) (2 citations) (Correct)
No context found.
Bergstra, J.A. and Klop, J.W. (1985), Algebra for communicating processes with abstraction. Theoretical Computer Science 37, pp77--121.
Clculo de Processos - Mtodos De Programao (Correct)
No context found.
J. Bergstra and J. Klop. Algebra for communicating processes with abstraction. Theoretical Computer Science, (37):77121, 1985.
Probabilistic Automata: System Types, Parallel Composition.. - Sokolova, de Vink (Correct)
No context found.
J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science 37 (1985), 77--121.
An Approach to the Design of Distributed Systems with B AMN.. - Butler (1996) (6 citations) (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoret. Comp. Sci., 37:77--121, 1985.
Bigraphs and Mobile Processes - Jensen, Milner (2003) (7 citations) (Correct)
No context found.
Bergstra, J.A. and Klop, J.W. (1985), Algebra for communicating processes with abstraction. Theoretical Computer Science 37, pp77--121.
Finite Axiom Systems for Testing Preorder and De Simone Process.. - Ulidowski (1996) (1 citation) (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, 1985.
Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
No context found.
J. Bergstra and J. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77--121, 1985.
Concurrency, Time and Constraints - Valencia (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, 1985.
Bigraphs and Mobile Processes - Jensen, Milner (2004) (7 citations) (Correct)
No context found.
Bergstra, J.A. and Klop, J.W. (1985), Algebra for communicating processes with abstraction. Theoretical Computer Science 37, pp77--121.
A Complete Order-theoretic Model for the Algebra of.. - Knijnenburg (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra for communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, 1985.
Swinging Data Types - The dielectic between actions and.. - Padawitz (1998) (Correct)
No context found.
J.A. Bergstra, J.W. Klop, Algebra of Communicating Processes with Abstraction, Theoretical Computer Science 37 (1985) 77-121
A Fixpoint Theory for Non-monotonic Parallelism - Chen (2002) (Correct)
No context found.
J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77--121, 1985.
Cones and Foci for Protocol Verification Revisited - Fokkink, Pang (2003) (Correct)
No context found.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77--121, 1985.
μCRL specification of event notification in JavaSpaces™? - Pol, Espada (Correct)
No context found.
Jan A. Bergstra and Jan Willem Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77-121, 1985.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC