pith. sign in

arxiv: 2409.02595 · v7 · submitted 2024-09-04 · 💻 cs.LO

Computation and Concurrency

Yong Wang This is my paper

Pith reviewed 2026-05-23 20:53 UTC · model grok-4.3

classification 💻 cs.LO
keywords pomsetc automatastep automatacommunication operatorslanguage equivalencetruly concurrent bisimilaritiescomputationconcurrency
0
0 comments X

The pith

Extending pomsetc and step automata with communication operators produces algebras that relate computation and concurrency.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper seeks to clarify the relationship between computation and concurrency. It builds on pomsetc automata and step automata by adding communication and other operators. These extensions lead to the definition of algebras. The algebras are considered modulo language equivalence and truly concurrent bisimilarities. This formalization aims to make the connection between the two concepts precise.

Core claim

Based on the so-called pomsetc automata and step automata, the paper introduces communication and more operators, and establishes the algebras modulo language equivalence and truly concurrent bisimilarities to clarify the relationship between computation and concurrency.

What carries the argument

Pomsetc automata and step automata extended with communication operators, used to establish algebras under language equivalence and truly concurrent bisimilarities.

If this is right

  • Algebras can be established that account for language equivalence in concurrent settings.
  • Truly concurrent bisimilarities can be incorporated into the algebraic framework.
  • The relationship between computation and concurrency is formalized through these operator extensions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The framework might enable comparisons with other concurrency models such as CCS or pi-calculus.
  • Practical applications could include analyzing concurrent programs using these algebraic structures.

Load-bearing premise

That adding communication and other operators to pomsetc and step automata results in well-defined algebras that capture the computation-concurrency relationship.

What would settle it

Demonstrating that the extended operators do not yield consistent algebras or fail to respect the specified equivalences and bisimilarities.

Figures

Figures reproduced from arXiv: 2409.02595 by Yong Wang.

Figure 1
Figure 1. Figure 1: PA accepting a ⋅ (b ∥ c) ⋅ d. q0 q1 q3 q4 q2 q6 q5 a d a ∣ b [PITH_FULL_IMAGE:figures/full_fig_p068_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: PA accepting a ⋅ (b ∣ c) ⋅ d. q0 q1 q3 q4 q2 q5 a b c d [PITH_FULL_IMAGE:figures/full_fig_p068_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: PA accepting a ⋅ (b ≬ c) ⋅ d. q0 q1 q2 q3 q4 q5 q6 q7 a b c d e f [PITH_FULL_IMAGE:figures/full_fig_p068_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: PA accepting (a ⋅ b ⋅ c) ≬ (d ⋅ e ⋅ f) with ρ(b, e) defined. q0 q1 q2 q3 q4 q5 q6 q7 q8 q9 a d ρ(b, e) c f [PITH_FULL_IMAGE:figures/full_fig_p068_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Equivalent PA accepting (a ⋅ b ⋅ c) ≬ (d ⋅ e ⋅ f) with ρ(b, e) defined. 65 [PITH_FULL_IMAGE:figures/full_fig_p068_5.png] view at source ↗
read the original abstract

We try to clarify the relationship between computation and concurrency. Base on the so-called pomsetc automata and step automata, we introduce communication and more operators, and establish the algebras modulo language equivalence and truly concurrent bisimilarities.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript claims to clarify the relationship between computation and concurrency. Based on pomsetc automata and step automata, it introduces communication and additional operators, then establishes algebras modulo language equivalence and truly concurrent bisimilarities.

Significance. If the operator definitions and equivalence proofs are sound, the work could contribute a formal algebraic link between sequential computation and true concurrency via automata extensions. However, the abstract provides no indication of specific operator semantics, derivation steps, or verification, so significance cannot be assessed from the given material.

major comments (2)
  1. Abstract: the claim that algebras are established is unsupported, as the text provides no derivation steps, definitions of the new operators (e.g., communication), or verification that the claimed equivalences hold under language equivalence or truly concurrent bisimilarities.
  2. Abstract (first sentence after base automata mention): the assumption that extending pomsetc and step automata with the introduced operators yields well-defined algebras capturing computation-concurrency relationships is stated without any supporting construction or proof sketch.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the review and the opportunity to clarify our presentation. We respond to the major comments below.

read point-by-point responses

  1. Referee: Abstract: the claim that algebras are established is unsupported, as the text provides no derivation steps, definitions of the new operators (e.g., communication), or verification that the claimed equivalences hold under language equivalence or truly concurrent bisimilarities.

    Authors: The full manuscript defines the communication operator and additional operators in Section 3, with the algebras and equivalence proofs (under language equivalence and truly concurrent bisimilarities) developed in Sections 4–6, including explicit derivation steps and verification. The abstract is intended only as a high-level summary of these results. We agree the abstract could more clearly signal the location of the supporting material and will revise it accordingly. revision: yes

  2. Referee: Abstract (first sentence after base automata mention): the assumption that extending pomsetc and step automata with the introduced operators yields well-defined algebras capturing computation-concurrency relationships is stated without any supporting construction or proof sketch.

    Authors: The manuscript supplies the required constructions and proof sketches in the body (Sections 3–6), where the extensions are formally introduced and the resulting algebras are shown to be well-defined. The abstract condenses the overall claim. We will revise the abstract to reference the sections containing the constructions. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The abstract and available text describe extending prior pomsetc and step automata models with communication operators to form algebras modulo language equivalence and bisimilarities. No equations, self-citations, or derivations are quoted that reduce any claimed result to its inputs by construction, fitted parameters renamed as predictions, or load-bearing self-citation chains. The derivation chain appears self-contained against external automata theory benchmarks, with the central claim resting on standard operator introductions and equivalence proofs rather than circular reductions.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review prevents enumeration of specific free parameters, axioms, or invented entities; none are explicitly named in the provided text.

pith-pipeline@v0.9.0 · 5531 in / 1003 out tokens · 18267 ms · 2026-05-23T20:53:31.699864+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finitary Truly Concurrent Bisimulations

    cs.LO 2026-05 unverdicted novelty 4.0

    Defines finitary versions of truly concurrent prebisimulations following the behavioural form to enable full abstraction in denotational semantics of concurrent processes.

Reference graph

Works this paper leans on

84 extracted references · 84 canonical work pages · cited by 1 Pith paper · 2 internal anchors

  1. [1]

    G. G. Winskel, M. Nielsen, Models for concurrency, DAIMI Report Series (463) (1993)

    work page 1993

  2. [2]

    Milner, Communication and concurrency, Printice Hal l, 1989

    R. Milner, Communication and concurrency, Printice Hal l, 1989

    work page 1989

  3. [3]

    Milner, A calculus of communicating systems, Springe r, 1980

    R. Milner, A calculus of communicating systems, Springe r, 1980

    work page 1980

  4. [4]

    Fokkink, Introduction to process algebra, 2nd Editio n, Springer-Verlag, 2007

    W. Fokkink, Introduction to process algebra, 2nd Editio n, Springer-Verlag, 2007

    work page 2007

  5. [5]

    Neilsen, G

    M. Neilsen, G. Plotkin, G. Winskel, Petri nets, event str uctures and domains, 1, University of Edinburgh. Department of Computer Science, 1979

    work page 1979

  6. [6]

    Winskel, Event structures, in: advanced course on Pet ri nets, Springer, 1986, pp

    G. Winskel, Event structures, in: advanced course on Pet ri nets, Springer, 1986, pp. 325– 392

    work page 1986

  7. [7]

    Winskel, An introduction to event structures, DAIMI R eport Series (278) (1989)

    G. Winskel, An introduction to event structures, DAIMI R eport Series (278) (1989)

    work page 1989

  8. [8]

    C. A. Petri, Non-sequential processes, GMD-ISF Report 7 7 (5) (1977)

    work page 1977

  9. [9]

    C. A. Petri, General net theory. communication discipli nes, in: proc. Joint IBM University of Newcastle Seminar, B. Shaw ed., Newcastle GB, 1976

    work page 1976

  10. [10]

    C. A. Petri, Concurrency as a basis of systems thinking, in: Proc. from 5th Scandinavian Logic Symposium, 1979, pp. 143–162

    work page 1979

  11. [11]

    J. L. Peterson, Petri nets, ACM Computing Surveys (CSUR ) 9 (3) (1977) 223–252

    work page 1977

  12. [12]

    Murata, Petri nets: properties, analysis and applic ations, Proceedings of the IEEE 77 (4) (1989) 541–580

    T. Murata, Petri nets: properties, analysis and applic ations, Proceedings of the IEEE 77 (4) (1989) 541–580

    work page 1989

  13. [13]

    Reisig, Petri nets: an introduction, Vol

    W. Reisig, Petri nets: an introduction, Vol. 4, Springe r Science & Business Media, 2012

    work page 2012

  14. [14]

    Hoare, B

    T. Hoare, B. M¨ oller, G. Struth, I. Wehrman, Concurrent kleene algebra, in: Proceedings of the CONCUR. 2009, 2009, pp. 399–414. URL http://dx.doi.org/10.1007/978-3-642-04081-8-27

    work page doi:10.1007/978-3-642-04081-8-27 2009

  15. [15]

    Hoare, S

    T. Hoare, S. v. Staden, B. M¨ oller, G. Struth, H. Zhu, Dev elopments in concurrent kleene algebra, J. Log. Algebr. Meth. Program. 85 (4) (2016) 617–63 6. URL http://doi.acm.org/10.1016/j.jlamp.2015.09.012

    work page doi:10.1016/j.jlamp.2015.09.012 2016

  16. [16]

    M. R. Laurence, G. Struth, Completeness theorems for bi -kleene algebras and series-parallel rational pomset languages, in: Proceedings of the RAMiCS. 2 014, 2014, pp. 65–82. URL http://dx.doi.org/10.1007/978-3-319-06251-8-5

    work page doi:10.1007/978-3-319-06251-8-5 2014

  17. [17]

    M. R. Laurence, G. Struth, Completeness theorems for po mset languages and concurrent kleene algebras, arXiv preprint arXiv:1705.05896 (2017)

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  18. [18]

    Brunet, D

    P. Brunet, D. Pous, G. Struth, On decidability of concur rent kleene algebra, in: Proceedings of the CONCUR. 2017, 2017, pp. 28:1–28:15. URL http://dx.doi.org/10.4230/LIPIcs.CONCUR.2017.28 82

    work page doi:10.4230/lipics.concur.2017.28 2017

  19. [19]

    Kapp´ e, P

    T. Kapp´ e, P. Brunet, A. Silva, F. Zanasi, Concurrent kl eene algebra: free model and completeness, in: Proceedings of the ESOP. 2018, 2018, pp. 8 56–882. URL http://dx.doi.org/10.1007/978-3-319-89884-1-30

    work page doi:10.1007/978-3-319-89884-1-30 2018

  20. [20]

    Kapp´ e, Concurrent kleene algebra: completeness an d decidability (doctoral dissertation, Ph.D

    T. Kapp´ e, Concurrent kleene algebra: completeness an d decidability (doctoral dissertation, Ph.D. thesis, UCL (University College London) (2020)

    work page 2020

  21. [21]

    Boudol, I

    G. Boudol, I. Castellani, A non-interleaving semantic s for ccs based on proved transitions, Fundamenta Informaticae 11 (4) (1988) 433–452

    work page 1988

  22. [22]

    Degano, R

    P. Degano, R. D. Nicola, U. Montanari, A partial orderin g semantics for ccs, Theoretical Computer Science 75 (3) (1990) 223–262

    work page 1990

  23. [23]

    G. Winskel, Event structure semantics for ccs and relat ed languages, in: Automata, Languages and Programming: Ninth Colloquium Aarhus, Denma rk, July 12–16, 1982 9, Springer, 1982, pp. 561–576

    work page 1982

  24. [24]

    S. B. Fr¨ oschle, T. T. Hildebrandt, On plain and heredit ary history-preserving bisimulation, in: Mathematical Foundations of Computer Science 1999: 24t h International Symposium, MFCS’99, Poland, September 6–10, 1999 Proceedings 24, Spri nger, 1999, pp. 354–365

    work page 1999

  25. [25]

    Armas-Cervantes, P

    A. Armas-Cervantes, P. Baldan, L. Garc ´ ıa-Ba˜ nuelos,Reduction of event structures under history preserving bisimulation, Journal of Logical and Al gebraic Methods in Programming 85 (6) (2016) 1110–1130

    work page 2016

  26. [26]

    Wang, Algebraic theory for true concurrency, Elsevi er AP, 2023

    Y. Wang, Algebraic theory for true concurrency, Elsevi er AP, 2023

    work page 2023

  27. [27]

    Wang, Handbook of truly concurrent process algebra, Elsevier MK, 2023

    Y. Wang, Handbook of truly concurrent process algebra, Elsevier MK, 2023

    work page 2023

  28. [28]

    E. Best, M. Koutny, A refined view of the box algebra, in: A pplication and Theory of Petri Nets 1995: 16th International Conference Turin, Italy, Jun e 26–30, 1995 Proceedings 16, Springer, 1995, pp. 1–20

    work page 1995

  29. [29]

    E. Best, R. Devillers, M. Koutny, The box algebra= petri nets + process expressions, Information and Computation 178 (1) (2002) 44–100

    work page 2002

  30. [30]

    E. Best, R. Devillers, M. Koutny, Petri net algebra, Spr inger Science & Business Media, 2013

    work page 2013

  31. [31]

    J. C. M. Baeten, T. Basten, Partial-order process algeb ra (and its relation to petri nets), in: Handbook of process algebra, Elsevier, 2001, pp. 769–87 2

    work page 2001

  32. [32]

    S. C. Kleene, Representation of events in nerve nets and finite automata, Automata studies 34 (1956) 3–41

    work page 1956

  33. [33]

    Salomaa, Two complete axiom systems for the algebra o f regular events, Journal of the ACM (JACM) 13 (1) (1966) 158–169

    A. Salomaa, Two complete axiom systems for the algebra o f regular events, Journal of the ACM (JACM) 13 (1) (1966) 158–169

    work page 1966

  34. [34]

    J. H. Conway, Regular algebra and finite machines, Chapm an and Hall, London, 1971

    work page 1971

  35. [35]

    Kozen, On induction vs

    D. Kozen, On induction vs. *-continuity, in: Kozen (Ed. ), Proc. Workshop on Logics of Programs 1981, Lecture Notes in Computer Science, Springer -Verlag, 1981, pp. 167–176. 83

    work page 1981

  36. [36]

    Kozen, A completeness theorem for kleene algebras an d the algebra of regular events, Tech

    D. Kozen, A completeness theorem for kleene algebras an d the algebra of regular events, Tech. Rep. TR90-1123, Cornell (May 1990)

    work page 1990

  37. [37]

    Pratt, Dynamic algebras and the nature of induction, in: Proc

    V. Pratt, Dynamic algebras and the nature of induction, in: Proc. 12th ACM Symp. on Theory of Computing, 1980, pp. 22–28

    work page 1980

  38. [38]

    Kuich, The kleene and parikh theorem in complete semi rings, in: Ottmann (Ed.), Proc

    W. Kuich, The kleene and parikh theorem in complete semi rings, in: Ottmann (Ed.), Proc. 14th Colloq. Automata, Languages, and Programming, V ol. 267 of Lecture Notes in Computer Science, Springer-Verlag, 1987, pp. 212–225

    work page 1987

  39. [39]

    Kozen, On Kleene algebras and closed semirings, Spri nger, 1990

    D. Kozen, On Kleene algebras and closed semirings, Spri nger, 1990

    work page 1990

  40. [40]

    Cohen, Hypotheses in kleene algebra, Tech

    E. Cohen, Hypotheses in kleene algebra, Tech. rep., Bel lcore, Bellcore (1994)

    work page 1994

  41. [41]

    Doumane, D

    A. Doumane, D. Kuperberg, D. Pous, P. Pradic, Kleene alg ebra with hypotheses, in: Pro- ceedings of the FOSSACS. 2019, 2019, pp. 207–223. URL http://dx.doi.org/10.1007/978-3-030-17127-8-12

    work page doi:10.1007/978-3-030-17127-8-12 2019

  42. [42]

    Cohen, D

    E. Cohen, D. Kozen, F. Smith, The complexity of kleene al gebra with tests, Tech. Rep. TR96-1598, Cornell University (1996)

    work page 1996

  43. [43]

    Kozen, On hoare logic and kleene algebra with tests, A CM Trans

    D. Kozen, On hoare logic and kleene algebra with tests, A CM Trans. Comput. Log. (2000) 60–76doi:10.1145/343369.3433785. URL http://doi.acm.org/10.1145/343369.343378

    work page doi:10.1145/343369.3433785 2000

  44. [44]

    Angus, D

    A. Angus, D. Kozen, Kleene algebra with tests and progra m schematology, Tech. Rep. TR2001-1844, Cornell University (2001)

    work page 2001

  45. [45]

    Kapp´ e, P

    T. Kapp´ e, P. Brunet, J. Rot, A. Silva, J. Wagemaker, F. Z anasi, Kleene algebra with observations, in: Proceedings of the CONCUR. 2019, 2019. URL http://dx.doi.org/10.4230

    work page 2019

  46. [46]

    McIver, E

    A. McIver, E. Cohen, C. Morgan, Using probabilistic kle ene algebra for protocol verification, in: Proceedings of the 9th International Conference on Rela tional Methods in Computer Science and 4th International Workshop on Applications of K leene Algebra, Springer Berlin Heidelberg, Manchester UK, 2006, pp. 296–310

    work page 2006

  47. [47]

    Wagemaker, Extensions of (concurrent) kleene algeb ra, Ph.D

    J. Wagemaker, Extensions of (concurrent) kleene algeb ra, Ph.D. thesis, Radboud University Nijmegen (2022)

    work page 2022

  48. [48]

    Jipsen, M

    P. Jipsen, M. A. Moshier, Concurrent kleene algebra wit h tests and branching automata, J. Log. Algebr. Meth. Program. 85 (4) (2016) 637–652. URL http://doi.acm.org/10.1016/j.jlamp.2015.12.005

    work page doi:10.1016/j.jlamp.2015.12.005 2016

  49. [49]

    Kapp´ e, P

    T. Kapp´ e, P. Brunet, A. Silva, J. Wagemaker, F. Zanasi, Concurrent kleene algebra with observations: from hypotheses to completeness, in: Procee dings of the FOSSACS. 2020, 2020, pp. 381–400. URL http://dx.doi.org/10.1007/978-3-030-45231-5-20

    work page doi:10.1007/978-3-030-45231-5-20 2020

  50. [50]

    Probabilistic Concurrent Kleene Algebra

    A. McIver, T. Rabehaja, G. Struth, Probabilistic concu rrent kleene algebra, arXiv preprint arXiv:1306.2697 (2013). 84

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  51. [51]

    McIver, T

    A. McIver, T. Rabehaja, G. Struth, An event structure mo del for probabilistic concurrent kleene algebra, in: Proceedings of the 19th International C onference Logic for Program- ming, Artificial Intelligence, and Reasoning, Springer Ber lin Heidelberg, Stellenbosch South Africa, 2013, pp. 653–667

    work page 2013

  52. [52]

    Jaskolka, R

    J. Jaskolka, R. Khedri, Q. Zhang, Endowing concurrent k leene algebra with communication actions, in: Relational and Algebraic Methods in Computer S cience: 14th International Conference, RAMiCS 2014, Marienstatt, Germany, April 28–M ay 1, 2014. Proceedings 14, Springer, 2014, pp. 19–36

    work page 2014

  53. [53]

    J. C. M. Baeten, P. J. L. Cuijpers, B. Luttik, P. J. A. van T ilburg, A process-theoretic look at automata, in: Fundamentals of Software Engineering : Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009 , Revised Selected Papers 3, Springer, 2010, pp. 1–33

    work page 2009

  54. [54]

    J. C. M. Baeten, P. J. L. Cuijpers, B. Luttik, P. J. A. van T ilburg, Models of computation: automata and processes, Technische Universiteit Eindhove n, Syllabus 2IT15 (2010)

    work page 2010

  55. [55]

    J. C. M. Baeten, B. Luttik, P. J. A. van Tilburg, Computat ions and interaction, in: Dis- tributed Computing and Internet Technology: 7th Internati onal Conference, ICDCIT 2011, Bhubaneshwar, India, February 9-12, 2011. Proceedings 7, S pringer, 2011, pp. 35–54

    work page 2011

  56. [56]

    J. C. M. Baeten, B. Luttik, P. J. A. van Tilburg, Turing me ets milner, in: CONCUR 2012–Concurrency Theory: 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings 23, Springer, 20 12, pp. 1–20

    work page 2012

  57. [57]

    E. Maia, N. Moreira, R. Reis, Partial derivative and pos ition bisimilarity automata, in: Implementation and Application of Automata: 19th Internat ional Conference, CIAA 2014, Giessen, Germany, July 30–August 2, 2014. Proceedings 19, S pringer, 2014, pp. 264–277

    work page 2014

  58. [58]

    J. C. M. Baeten, B. B. Luttik, T. Muller, P. J. A. van Tilbu rg, Expressiveness modulo bisimilarity of regular expressions with parallel composi tion, Mathematical Structures in Computer Science 26 (6) (2016) 933–968

    work page 2016

  59. [59]

    Milner, A complete inference system for a class of reg ular behaviours, J

    R. Milner, A complete inference system for a class of reg ular behaviours, J. Comput. System Sci. 28 (3) (1984) 439–466

    work page 1984

  60. [60]

    V. N. Redko, On defining relations for the algebra of regu lar events, Ukrainskii Matem- aticheskii Zhurnal 16 (1964) 120–126

    work page 1964

  61. [61]

    Fokkink, H

    W. Fokkink, H. Zantema, Basic process algebra with iter ation: completeness of its equa- tional axioms, Comput. J. 37 (4) (1994) 259–267

    work page 1994

  62. [62]

    W. Fokkink, On the completeness of the equations for the kleene star in bisimulation, in: Algebraic Methodology and Software Technology: Procee dings of the 5th International Conference, AMAST’96 Munich, Germany, July 1–5, Springer, 1996, pp. 180–194

    work page 1996

  63. [63]

    J. A. Bergstra, A. Ponse, Non-regular iterators in proc ess algebra, Theoretical Computer Science 269 (1-2) (2001) 203–229

    work page 2001

  64. [64]

    J. A. Bergstra, I. Bethke, A. Ponse, Process algebra wit h iteration and nesting, The Com- puter Journal 37 (4) (1994) 243–258. 85

    work page 1994

  65. [65]

    J. A. Bergstra, I. Bethke, A. Ponse, Process algebra wit h iteration, Citeseer, 1993

    work page 1993

  66. [66]

    Fokkink, A complete equational axiomatization for p refix iteration, Information pro- cessing letters 52 (6) (1994) 333–337

    W. Fokkink, A complete equational axiomatization for p refix iteration, Information pro- cessing letters 52 (6) (1994) 333–337

    work page 1994

  67. [67]

    Fokkink, A complete axiomatization for prefix iterat ion in branching bisimulation, Fun- damenta Informaticae 26 (2) (1996) 103–113

    W. Fokkink, A complete axiomatization for prefix iterat ion in branching bisimulation, Fun- damenta Informaticae 26 (2) (1996) 103–113

    work page 1996

  68. [68]

    Aceto, A

    L. Aceto, A. Ing´ olfsd´ ottir, A complete equational ax iomatization for prefix iteration with silent steps, BRICS Report Series 2 (5) (1995)

    work page 1995

  69. [69]

    Aceto, W

    L. Aceto, W. Fokkink, An equational axiomatization for multi-exit iteration, Information and Computation 137 (2) (1997) 121–158

    work page 1997

  70. [70]

    R. J. van Glabbeek, Axiomatizing flat iteration, Lectur e notes in computer science (1997) 228–242

    work page 1997

  71. [71]

    Grabmayer, W

    C. Grabmayer, W. Fokkink, A complete proof system for 1- free regular expressions modulo bisimilarity, in: Saarbr¨ ucken (Ed.), Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS’20, ACM, New York, NY, USA , 2020, pp. 465–478

    work page 2020

  72. [72]

    Grabmayer, Structure-constrained process graphs f or the process semantics of regular expressions, in: P

    C. Grabmayer, Structure-constrained process graphs f or the process semantics of regular expressions, in: P. Bahr (Ed.), Proceedings 11th Internati onal Workshop on Computing with Terms and Graphs, Vol. 334, Paparazzi Press, Waterloo, NSW 2017, Australia, 2021, pp. 29–45

    work page 2017

  73. [73]

    Grabmayer, A coinductive version of milner’s proof s ystem for regular expressions modulo bisimilarity, in: F

    C. Grabmayer, A coinductive version of milner’s proof s ystem for regular expressions modulo bisimilarity, in: F. Gadducci, A. Silva (Eds.), Proceeding s of the 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021), Vol. 3, Schl oss Dagstuhl–Leibniz- Zentrum f¨ ur Informatik, Dagstuhl, Germany, 2021, pp. 16:1–16:23

    work page 2021

  74. [74]

    C. Grabmayer, Milner’s proof system for regular expres sions modulo bisimilarity is com- plete: crystallization: near-collapsing process graph in terpretations of regular expressions, in: Proceedings of the 37th Annual ACM/IEEE Symposium on Log ic in Computer Science, ACM, 2022, pp. 1–13

    work page 2022

  75. [75]

    Grabmayer, The image of the process interpretation o f regular expressions is not closed under bisimulation collapse, arXiv preprint arXiv:2303.0 8553 (2023)

    C. Grabmayer, The image of the process interpretation o f regular expressions is not closed under bisimulation collapse, arXiv preprint arXiv:2303.0 8553 (2023)

    work page 2023

  76. [76]

    J. C. M. Baeten, F. Corradini, C. A. Grabmayer, A charact erization of regular expressions under bisimulation, Journal of the ACM (JACM) 54 (2) (2007) 6 –es

    work page 2007

  77. [77]

    Lodaya, P

    K. Lodaya, P. Weil, A kleene iteration for parallelism, in: Foundations of Software Technol- ogy and Theoretical Computer Science: 18th Conference, Che nnai, India, December 17-19,

    work page

  78. [78]

    Proceedings 18, Springer, 1998, pp. 355–366

    work page 1998

  79. [79]

    Lodaya, P

    K. Lodaya, P. Weil, Series-parallel posets: algebra, a utomata and languages, in: Annual Symposium on Theoretical Aspects of Computer Science, Spri nger, 1998, pp. 555–565

    work page 1998

  80. [80]

    Lodaya, P

    K. Lodaya, P. Weil, Series-parallel languages and the b ounded-width property, Theoretical Computer Science 237 (1-2) (2000) 347–380. 86

    work page 2000

Showing first 80 references.