| Alternate document: Details Unification in a Process Algebra With Choice and Sequential Composition (94) N.J. Drost |
(Enter summary)
Abstract: This paper contains a unification algorithm for a restricted process algebra with as only operators
nondeterministic choice and unary action prefix-operators, and with infinite processes.
Termination is ensured by using a modified version of a method for syntactic unification described
in [Col84a] and [Col84b]. The algorithm contains a procedure to remove non-most
general solutions.
Key words and phrases: unification, process algebra.
Contents
1 Introduction 2
2 Algebra and theory 5
2.1... (Update)
Context of citations to this paper: More
...absent. The unification problem in an algebra with choice and action prefix is finitary, even in the presence of infinite processes [Dro93], but in the algebra with choice and sequential composition it is infinitary. It is still an open question whether there are more...
Cited by: More
The Algebra of - Finite State Processes
(Correct)
Unification in a Process Algebra With Choice and Sequential.. - Drost (1994)
(Correct)
Active bibliography (related documents): More All
0.5: A correctness proof for Warren's HO into FO translation - Gonzalez-Moreno (1993)
(Correct)
0.2: A Complete Order-theoretic Model for the Algebra of.. - Knijnenburg (1994)
(Correct)
0.2: Comparative Semantics for a Process Language With Probabilistic .. - den Hartog (1998)
(Correct)
Similar documents based on text: More All
0.1: GARCH for Irregularly Spaced Financial Data: The ACD-GARCH Model - Ghysels, Jasiak (1997)
(Correct)
0.1: Efficient Estimation in AR Models with ARCH Errors - Maercker
(Correct)
0.0: Virtual Reality Treatment in Acrophobia: A Comparison.. - Emmelkamp, Bruynzeel.. (2001)
(Correct)
Related documents from co-citation: More All
3: Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland - 1990
2: Bisimulations and divergence (context) - Walker - 1988
2: A Domain Equation for Bisimulation (context) - Abramsky - 1988
BibTeX entry: (Update)
Drost, N.J.: Unification in an Algebra with Choice and Action Prefix. Report P93xx, Programming Research Group, University of Amsterdam. 1993. http://citeseer.ist.psu.edu/drost94unification.html More
@misc{ drost93unification,
author = "N. Drost",
title = "Unification in an Algebra with Choice and Action Prefix",
text = "Drost, N.J.: Unification in an Algebra with Choice and Action Prefix. Report
P93xx, Programming Research Group, University of Amsterdam. 1993.",
year = "1993",
url = "citeseer.ist.psu.edu/drost94unification.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985
1933
Communication and Concurrency (context) - Milner - 1989
634
A Machine Oriented Logic Based on the Resolution Principle (context) - Robinson - 1965
484
A Calculus of Communicating Systems (context) - Milner - 1980
266
Cambridge Tracts in Theoretical Computer Science (context) - Baeten - 1990
114
Building-in equational theories (context) - Plotkin - 1972
94
Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
30
Unification in a Combination of Arbitrary Disjoint Equationa.. (context) - Schmidt-Schauss - 1989
23
ese de Doctorat d (context) - Huet - 1976
13
Efficient Unification over Infinite Terms (context) - Jaffar - 1982
7
Vaandrager: An efficient algorithm for branching bisimulatio.. (context) - Groote - 1990
5
Kirchner: Solving Equations in Abstract Algebras: A RuleBase.. (context) - Jouannaud - 1991
5
Klop: Process Algebra for Synchronous Communication (context) - Bergstra - 1984
4
Metric Spaces and Ready Sets in the Semantics of Uniform Con.. (context) - Bakker, de and et al. - 1988
2
Montanari: An Efficient Unification Algorithm (context) - Martelli - 1982
2
Jouannaud: Notations for rewriting (context) - Dershowitz - 1991
1
Equations et inequations sur les arbres finis et infinis (context) - Colmerauer - 1984
1
Unification in the algebra of sets with union and empty set (context) - Drost - 1992
Documents on the same site (http://fermivista.math.jussieu.fr/http/www.wins.uva.nl.html): More
Forcing in Finite Structures - Zambella (1996)
(Correct)
From Box to TEX: An algebraic approach to the construction .. - van den Brand, Visser (1994)
(Correct)
Data Flow Analysis for Reverse Engineering - Moonen (1996)
(Correct)
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