L. ACETO, W. FOKKINK, AND A. INGOLFSDOTTIR, A menagerie of non-finitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193--230. 27 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bisimilarity is not Finitely Based over BPA with Interrupt - Aceto, Fokkink.. (2004) Self-citation (Aceto Fokkink) (Correct)
No context found.
L. ACETO, W. FOKKINK, AND A. INGOLFSDOTTIR, A menagerie of non-finitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193--230. 27
Some of My Favourite Results in Classic Process Algebra - Aceto (2003) Self-citation (Aceto) (Correct)
No context found.
L. Aceto, W. Fokkink, and A. Ing olfsd ottir, A menagerie of nonfinitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193--230.
Nested Semantics over Finite Trees are Equationally Hard - Aceto, Fokkink, van.. (2003) Self-citation (Aceto Fokkink) (Correct)
No context found.
L. ACETO, W. FOKKINK AND A. ING OLFSD OTTIR, A menagerie of non-finitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193--230.
2-Nested Simulation is not Finitely Equationally Axiomatizable - Aceto, al. (2000) Self-citation (Aceto Fokkink Olfsd) (Correct)
No context found.
L. Aceto, W. Fokkink, and A. Ing olfsd ottir, A menagerie of non-finitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193--230.
The Max-Plus Algebra of the Natural Numbers has no .. - Aceto.. (1999) Self-citation (Aceto Olfsd) (Correct)
....by showing that the collection of identities which hold in the algebra N of the natural numbers with constant zero, and binary operations of sum and maximum is not finitely based. Our interest in this problem stems from previous work by two of the authors in the field of concurrency theory, see [2]. In op. cit. a collection of results was given to the e#ect that no fully invariant congruence that includes ready simulation [5, 13] and is included in language equivalence has a finite equational basis over the language of Basic Process Algebra with Iteration (BPA # ) 3] This should be ....
....equivalence has a finite equational basis over the language of Basic Process Algebra with Iteration (BPA # ) 3] This should be contrasted with the positive result obtained by Fokkink and Zantema in [11] who showed that bisimulation congruence [21] is finitely based over the language BPA # . In [2], it was left open whether trace congruence has a finite equational basis over the language BPA [4] when the alphabet of actions is a singleton, say a . Let us recall that, in that case, the signature of BPA contains a constant a, and binary operations of concatenation and choice. Trace ....
[Article contains additional citation context not shown here]
L. Aceto, W. J. Fokkink, and A. Ing olfsd ottir, A menagerie of non-finitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8
2-Nested Simulation is not Finitely Equationally.. - Aceto, Fokkink.. (2000) Self-citation (Aceto Fokkink Olfsd) (Correct)
.... BCCS for most of the other behavioural equivalences in the linear time branching time spectrum that are reviewed by van Glabbeek in [8] Only in the case of additional, more complex operators, such as iteration, are these equivalences known to lack a finite equational axiomatization; see, e.g. [3, 6, 7, 20, 21]. Of special relevance for concurrency theory are Moller s results to the e#ect that the process algebras ACP and CCS (without the auxiliary left merge operator from [5] do not have a finite equational axiomatization modulo bisimulation equivalence [17, 18] Aceto, Esik and Ingolfsdottir [2] ....
L. Aceto, W. Fokkink, and A. Ing olfsd ottir, A menagerie of non-finitely based process semantics over BPA*---from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193--230.
Axiomatizations for the Perpetual Loop in Process Algebra - Fokkink Self-citation (Fokkink) (Correct)
....axiomatization for BPA , i.e, for basic process algebra with the binary Kleene star without the special constants ffi and ffl, modulo bisimulation. Their conjecture that it is complete was solved by Fokkink and Zantema [14] In contrast with this result, Aceto, Fokkink and Ing olfsd ottir [3] showed that there does not exist a complete finite equational axiomatization for BPA modulo any process semantics in between ready simulation and completed traces. In [11] a new proof for the completeness result from [14] was presented. This new proof technique was applied successfully not ....
L. Aceto, W.J. Fokkink, and A. Ing'olfsd'ottir. A menagerie of non-finitely based process semantics over BPA : from ready simulation to completed traces. Report RS-96-23, BRICS, Aalborg University, 1996.
An Axiomatization for the Terminal Cycle - Fokkink (1996) Self-citation (Fokkink) (Correct)
....and Ponse [7] suggested a finite equational axiomatization for basic process algebra with the binary Kleene star, denoted by BPA , modulo bisimulation. Their conjecture that it is complete was solved by Fokkink and Zantema [14] In contrast with this result, Aceto, Fokkink and Ing olfsd ottir [3] showed that there does not exist a complete finite equational axiomatization for BPA modulo any process semantics in between ready simulation and completed traces. In [12] a new proof for the completeness result from [14] was presented. The proof technique that was introduced in [12] was ....
L. Aceto, W.J. Fokkink, and A. Ing'olfsd'ottir. A menagerie of non-finitely based process semantics over BPA : from ready simulation to completed traces. Technical report, BRICS, Aalborg University, 1996.
Language Preorder as a Precongruence - Wan Fokkink Self-citation (Fokkink) (Correct)
No context found.
L. Aceto, W.J. Fokkink and A. Ing'olfsd'ottir. A menagerie of non-finitely based process semantics over BPA . Mathematical Structures in Computer Science, To appear.
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