See this document in CiteSeerX!

A Note on an Expressiveness Hierarchy for Multi-exit Iteration (2002)  (Make Corrections)  
Luca Aceto, Willem Jan Fokkink, Anna Ingolfsdottir



  Home/Search   Context   Related

 
View or download:
brics.dk/RS/02/40/...ICSRS0240.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.auc.dk/~luca/reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Multi-exit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form X1 = P1X2 +Q1 . (Update)

Similar documents (at the sentence level):
68.0%:   A Note on an Expressiveness Hierarchy - For Multi-Exit Iteration   (Correct)
17.3%:   An Equational Axiomatization for Multi-Exit Iteration - Aceto, Fokkink (1996)   (Correct)

Active bibliography (related documents):   More   All
0.2:   From Ready Simulation Semantics to Completed Tracs - Fokkink, Ingólfsdóttir (1996)   (Correct)
0.2:   On the Completeness of the Equations for the Kleene Star in.. - Fokkink (1996)   (Correct)
0.1:   Two Recursive Generalizations of Iteration in Process Algebra - Bergstra (1998)   (Correct)

Similar documents based on text:   More   All
2.4:   2-Nested Simulation is not Finitely Equationally.. - Aceto, Fokkink.. (2000)   (Correct)
1.8:   A Cook's Tour of Equational Axiomatizations for Prefix.. - Aceto, Fokkink.. (1998)   (Correct)
1.6:   The Max-Plus Algebra of the Natural Numbers has no .. - Aceto.. (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ aceto-note,
  author = "Luca Aceto and Willem Jan Fokkink and Anna Ingolfsdottir",
  title = "A Note on an Expressiveness Hierarchy for Multi-exit Iteration",
  url = "citeseer.ist.psu.edu/aceto02note.html" }
Citations (may not include all citations):
502   Concurrency and automata on infinite sequences (context) - Park - 1981
266   Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland et al. - 1990
192   Representation of events in nerve nets and finite automata (context) - Kleene - 1956
123   A congruence theorem for structured operational semantics - Baeten, Verhoef
113   Decidability of bisimulation equivalence for processes gener.. (context) - Baeten, Bergstra et al. - 1993
27   Fixed point semantics (context) - Bergstra, Klop - 1982
19   Process algebra with iteration - Bergstra, Bethke et al. - 1993
16   Theoretical Informatics and Applications (context) - Caucal, de graphes - 1990
8   An Equational Axiomatization for Multiexit Iteration - Aceto, Fokkink - 1997

Documents on the same site (http://www.cs.auc.dk/~luca/reports.html):   More
Relating Distributed, Temporal and Causal Observations of Simple.. - Aceto   (Correct)
Timing and Causality in Process Algebra - Aceto, Murphy (1992)   (Correct)
Decorated Trace Semantics over BPA have no Finite.. - Aceto, Fokkink..   (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