On the public citation graph

Equivalence and membership problems for regular trace languages

https://doi.org/10.1007/bfb0012757
0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10856-4_86openalex-snapshot
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-16761-7_75openalex-snapshot
On recognizable subsets of free partially commutative monoids
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_30openalex-snapshot
Trace theory
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_20openalex-snapshot
Decision problems for regular trace languages
inferred← citeshttps://doi.org/10.1007/3-540-51082-6_68openalex-snapshot
On the prefixes of a random trace and the membership problem for context-free trace languages
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_89openalex-snapshot
Characterization of recognizable trace languages by distributed automata
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_51openalex-snapshot
Ignoring nonessential interleavings in assertional reasoning on concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_137openalex-snapshot
Code problems on traces
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_15openalex-snapshot
Language Inclusion for Finite Prime Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_22openalex-snapshot
Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_11openalex-snapshot
From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_11openalex-snapshot
On the Structure of Dependence Graphs
inferred← citeshttps://doi.org/10.1007/bf02088289openalex-snapshot
Characterizations of the decidability of some problems for regular trace languages
inferred← citeshttps://doi.org/10.1007/bfb0013025openalex-snapshot
Basic notions of trace theory
inferred← citeshttps://doi.org/10.1007/bfb0030293openalex-snapshot
Traces, histories, graphs: Instances of a process monoid
inferred← citeshttps://doi.org/10.1007/bfb0035857openalex-snapshot
On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages
inferred← citeshttps://doi.org/10.1007/bfb0039193openalex-snapshot
Analysis of a class of algorithms for problems on trace languages
inferred← citeshttps://doi.org/10.1007/bfb0072524openalex-snapshot
Heaps of pieces, I : Basic definitions and combinatorial lemmas
inferred← citeshttps://doi.org/10.1007/s10703-016-0256-5openalex-snapshot
From non-preemptive to preemptive scheduling using synchronization synthesis
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00046-yopenalex-snapshot
The lattices of prefixes and overlaps of traces
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90101-2openalex-snapshot
Trace monoids with some invertible generators: two decision problems
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90053-7openalex-snapshot
Partial commutations and faithful rational transductions
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90080-6openalex-snapshot
On regular trace languages
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90027-8openalex-snapshot
On recognizable subsets of free partially commutative monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90051-5openalex-snapshot
Theory of traces
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90354-iopenalex-snapshot
On the decidability of the equivalence problem for partially commutative rational power series
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90347-vopenalex-snapshot
∏11-universality of some propositional logics of concurrent programs
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90051-5openalex-snapshot
Membership problems for regular and context-free trace languages
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90010-fopenalex-snapshot
Efficient solution of some problems in free partially commutative monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00216-2openalex-snapshot
The code problem for traces — improving the boundaries
inferred← citeshttps://doi.org/10.1051/ita/1986200201031openalex-snapshot
Trace languages defined by regular string languages
inferred← citeshttps://doi.org/10.1051/ita/1989230403951openalex-snapshot
Compositions de fonctions de commutation partielle
inferred← citeshttps://doi.org/10.1051/ita/1990240404091openalex-snapshot
Complete subgraphs of bipartite graphs and applications to trace languages
inferred← citeshttps://doi.org/10.1051/ita/1993270100071openalex-snapshot
On the structure of recognizable languages of dependence graphs
inferred← citeshttps://doi.org/10.1051/ita/1998321-300791openalex-snapshot
On the inclusion problem for finitely ambiguous rational trace languages
inferred← citeshttps://doi.org/10.1051/ita/1998324-601411openalex-snapshot
Analysis of algorithms for the recognition of rational and context-free trace languages
inferred← citeshttps://doi.org/10.1109/tc.2012.252openalex-snapshot
Verifying and Comparing Finite State Machines for Systems that Have Distributed Interfaces
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16436.xopenalex-snapshot
Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas
inferred← citeshttps://doi.org/10.48550/arxiv.1108.5295openalex-snapshot
Checking Finite State Machine Conformance when there are Distributed Observations
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04533openalex-snapshot
From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1511.07163openalex-snapshot
Optimizing Solution Quality in Synchronization Synthesis
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.