On the public citation graph

On the concatenation of infinite traces

https://doi.org/10.1007/bfb0020791

0 signed · 21 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/bfb0022473openalex-snapshot

Adequate path expressions

inferredcites →https://doi.org/10.1007/bfb0027043openalex-snapshot

Infinitary languages: Basic theory and applications to concurrent systems

inferredcites →https://doi.org/10.1016/0020-0190(90)90061-2openalex-snapshot

A metric for traces

inferredcites →https://doi.org/10.1016/0304-3975(84)90053-7openalex-snapshot

Partial commutations and faithful rational transductions

inferredcites →https://doi.org/10.1016/0304-3975(85)90206-3openalex-snapshot

Maximal serializability of iterated transactions

inferredcites →https://doi.org/10.1051/ita/1985190100211openalex-snapshot

Automates et commutations partielles

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

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-54233-7_139openalex-snapshot

A Kleene theorem for infinite trace languages

inferred← citeshttps://doi.org/10.1007/3-540-54345-7_56openalex-snapshot

Recognizable complex trace languages (abstract)

inferred← citeshttps://doi.org/10.1007/3-540-55610-9_166openalex-snapshot

Esprit basic research action 3148 DEMON (Design methods based on nets) — Aims, scope and achievements —

inferred← citeshttps://doi.org/10.1007/3-540-55610-9_179openalex-snapshot

A survey of recognizable languages of infinite traces

inferred← citeshttps://doi.org/10.1007/3-540-55719-9_106openalex-snapshot

Asynchronous cellular automata for infinite traces

inferred← citeshttps://doi.org/10.1007/3-540-55808-x_24openalex-snapshot

Poset properties of complex traces

inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_8openalex-snapshot

A Characterization of Combined Traces Using Labeled Stratified Order Structures

inferred← citeshttps://doi.org/10.1007/bf01178512openalex-snapshot

Deterministic asynchronous automata for infinite traces

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90209-copenalex-snapshot

On the concatenation of infinite traces

inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00283-4openalex-snapshot

The word problem for 1LC congruences is NP-hard

inferred← citeshttps://doi.org/10.1109/pnpm.1991.238797openalex-snapshot

Overview of the results of the Esprit basic research action DEMON-design methods based on nets

inferred← citeshttps://doi.org/10.1142/s021819679800017xopenalex-snapshot

Topology for Computations of Concurrent Automata

inferred← citeshttps://doi.org/10.4064/dm428-0-1openalex-snapshot

Partially ordered sets with projections and their topology

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.