On the public citation graph
An Equational Axiomatization of Bisimulation over Regular Expressions
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1996.0047openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
inferredcites →https://doi.org/10.1006/inco.1997.2645openalex-snapshot
An Equational Axiomatization for Multi-exit Iteration
inferredcites →https://doi.org/10.1006/jcss.1999.1636openalex-snapshot
Models of Nondeterministic Regular Expressions
inferredcites →https://doi.org/10.1007/3-540-63165-8_212openalex-snapshot
Axiomatizations for the perpetual loop in process algebra
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_16openalex-snapshot
Communicating Sequential Processes
inferredcites →https://doi.org/10.1007/bfb0013021openalex-snapshot
Process theory based on bisimulation semantics
inferredcites →https://doi.org/10.1007/bfb0014315openalex-snapshot
On the completeness of the equations for the Kleene star in bisimulation
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/s0168-0072(97)00036-5openalex-snapshot
Nonaxiomatisability of equivalences over finite state processes
inferredcites →https://doi.org/10.1016/s1571-0661(05)80249-xopenalex-snapshot
Tree Morphisms and Bisimulations
inferredcites →https://doi.org/10.1017/s0960129500000116openalex-snapshot
Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
inferredcites →https://doi.org/10.1051/ita:1999127openalex-snapshot
A Finite Axiomatization of Nondeterministic Regular Expressions
inferredcites →https://doi.org/10.1093/comjnl/37.4.259openalex-snapshot
Basic Process Algebra with Iteration: Completeness of its Equational Axioms
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_5openalex-snapshot
An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them I: Language Extension Mechanisms
inferred← citeshttps://doi.org/10.1007/s10458-014-9263-3openalex-snapshot
A logic of intention and action for regular BDI agents based on bisimulation of agent programs
inferred← citeshttps://doi.org/10.1016/j.ic.2009.05.005openalex-snapshot
Is observational congruence on μ -expressions axiomatisable in equational Horn logic?
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.033openalex-snapshot
Axiomatizing weighted synchronization trees and weighted bisimilarity
inferred← citeshttps://doi.org/10.1109/lics.2005.43openalex-snapshot
Regular Expressions in Process Algebra
inferred← citeshttps://doi.org/10.1145/1219092.1219094openalex-snapshot
A characterization of regular expressions under bisimulation
inferred← citeshttps://doi.org/10.1145/3373718.3394744openalex-snapshot
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
inferred← citeshttps://doi.org/10.1145/3531130.3532430openalex-snapshot
Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete
inferred← citeshttps://doi.org/10.1145/3763063openalex-snapshot
Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge
inferred← citeshttps://doi.org/10.4204/eptcs.288.1openalex-snapshot
Modeling Terms by Graphs with Structure Constraints (Two Illustrations)
inferred← citeshttps://doi.org/10.4204/eptcs.408.2openalex-snapshot
From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12740openalex-snapshot
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.