On the public citation graph

On the Axiomatizability of Priority

0 signed · 40 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.1006/inco.1995.1003openalex-snapshot
CCS with Priority Choice
inferredcites →https://doi.org/10.1006/inco.1995.1039openalex-snapshot
On Deciding Readiness and Failure Equivalences for Processes
inferredcites →https://doi.org/10.1007/11548133_4openalex-snapshot
Bisimilarity Is Not Finitely Based over BPA with Interrupt
inferredcites →https://doi.org/10.1007/11601548_18openalex-snapshot
Finite Equational Bases in Process Algebra: Results and Open Questions
inferredcites →https://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1007/3-540-60692-0_57openalex-snapshot
On the expressive power of CCS
inferredcites →https://doi.org/10.1007/3-540-61042-1_50openalex-snapshot
Priorities for modeling and verifying distributed systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0032072openalex-snapshot
The importance of the left merge operator in process algebras
inferredcites →https://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferredcites →https://doi.org/10.1007/bfb0039068openalex-snapshot
A new strategy for proving ω-completeness applied to process algebra
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0890-5401(90)90059-qopenalex-snapshot
Priorities in process algebras
inferredcites →https://doi.org/10.1016/b978-0-444-82830-9.x5017-6openalex-snapshot
Handbook of Process Algebra
inferredcites →https://doi.org/10.1016/b978-044482830-9/50019-9openalex-snapshot
The Linear Time - Branching Time Spectrum I.**This is an extension of [20]. The research reported in this paper has been initiated at CWI in Amsterdam, continued at the Technical University of Munich, and finalized at Stanford University. It has been supported by Sonderforschungsbereich 342 of the…
inferredcites →https://doi.org/10.1016/b978-044482830-9/50030-8openalex-snapshot
Priority in Process Algebra
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.003openalex-snapshot
CCS with Hennessy's merge has no finite-equational axiomatization
inferredcites →https://doi.org/10.1016/j.tcs.2006.07.003openalex-snapshot
Bisimilarity is not finitely based over BPA with interrupt
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0168-0072(97)00036-5openalex-snapshot
Nonaxiomatisability of equivalences over finite state processes
inferredcites →https://doi.org/10.1109/lics.1990.113741openalex-snapshot
The nonexistence of finite axiomatisations for CCS congruences
inferredcites →https://doi.org/10.1142/s0218196795000227openalex-snapshot
ALGORITHMIC PROBLEMS IN VARIETIES
inferredcites →https://doi.org/10.1145/200836.200876openalex-snapshot
Bisimulation can't be traced
inferredcites →https://doi.org/10.1145/227683.227687openalex-snapshot
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.3233/fi-1986-9202openalex-snapshot
Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1
inferredcites →https://doi.org/10.3233/fi-1990-13202openalex-snapshot
A Process Specification Formalism1
inferredcites →https://doi.org/10.7146/brics.v13i1.21907openalex-snapshot
On the Axiomatizability of Priority
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML

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-0-387-09680-3_21openalex-snapshot
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_14openalex-snapshot
Is Observational Congruence Axiomatisable in Equational Horn Logic?
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_2openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferred← citeshttps://doi.org/10.1007/s00236-010-0114-7openalex-snapshot
Lifting non-finite axiomatizability results to extensions of process algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.07.025openalex-snapshot
Impossibility Results in the Equational Logic of Processes
inferred← citeshttps://doi.org/10.1016/j.ic.2007.05.001openalex-snapshot
Priority and abstraction in process algebra
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.2020.07.044openalex-snapshot
On the axiomatisability of priority III: Priority strikes again
inferred← citeshttps://doi.org/10.1109/cise.2009.5367013openalex-snapshot
Process Algebra for Web Servers with Timed-Priority Executing Policy
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.8openalex-snapshot
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
inferred← citeshttps://doi.org/10.4304/jsw.6.9.1688-1695openalex-snapshot
Process Algebra with Timed-Priority Executing Policy
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.