On the public citation graph
Event fairness and non-interleaving concurrency
0 signed · 55 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.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-13345-3_37openalex-snapshot
Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness
inferredcites →https://doi.org/10.1007/3-540-15641-0_26openalex-snapshot
Deterministic asynchronous automata
inferredcites →https://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferredcites →https://doi.org/10.1007/bfb0013028openalex-snapshot
Permutation of transitions: An event structure semantics for CCS and SCCS
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1007/bfb0027048openalex-snapshot
Petri nets: Basic notions, structure, behaviour
inferredcites →https://doi.org/10.1016/0020-0190(84)90097-8openalex-snapshot
Fairness and conspiracies
inferredcites →https://doi.org/10.1016/0020-0190(84)90114-5openalex-snapshot
Fairness and conspiracies
inferredcites →https://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferredcites →https://doi.org/10.1145/41625.41642openalex-snapshot
Appraising fairness in distributed languages
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-45605-8_7openalex-snapshot
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_52openalex-snapshot
Defining process fairness for non-interleaving concurrency
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_3openalex-snapshot
On the domain of traces and sequential composition
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_106openalex-snapshot
Fairness in models with true concurrency
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_40openalex-snapshot
Infinite behaviour and fairness in concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_34openalex-snapshot
All from one, one for all: on model checking using representatives
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_69openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_62openalex-snapshot
Petri nets, traces, and local model checking
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_48openalex-snapshot
Formal verification of a partial-order reduction technique for model checking
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_141openalex-snapshot
Partial order reduction: Model-checking using representatives
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_78openalex-snapshot
An algorithmic approach for checking closure properties of Ω-regular languages
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_20openalex-snapshot
Using Asynchronous Büchi Automata for Efficient Automatic Verification of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_15openalex-snapshot
Concurrency, Fairness and Logical Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-41591-8_14openalex-snapshot
LTL Model Checking under Fairness in ProB
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_32openalex-snapshot
Model Checking Conformance with Scenario-Based Specifications
inferred← citeshttps://doi.org/10.1007/bf00121262openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bf03180567openalex-snapshot
Multitraces, hypertraces and partial order semantics
inferred← citeshttps://doi.org/10.1007/bfb0017489openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1007/bfb0032041openalex-snapshot
Stability and sequentiality in dataflow networks
inferred← citeshttps://doi.org/10.1007/bfb0032058openalex-snapshot
Proving partial order liveness properties
inferred← citeshttps://doi.org/10.1007/bfb0084792openalex-snapshot
Sometimes ‘some’ is as good as ‘all’
inferred← citeshttps://doi.org/10.1007/s11704-013-3091-5openalex-snapshot
Model checking with fairness assumptions using PAT
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90184-hopenalex-snapshot
Petri net semantics of priority systems
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.035openalex-snapshot
Modelling Component Behaviour with Concurrent Automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00225-3openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00326-xopenalex-snapshot
Petri nets, traces, and local model checking
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00219-3openalex-snapshot
An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages
inferred← citeshttps://doi.org/10.1023/a:1006225515062openalex-snapshot
Formal Verification of a Partial-Order Reduction Technique for Model Checking
inferred← citeshttps://doi.org/10.1109/cdc.2011.6160740openalex-snapshot
Synthesis of distributed control and communication schemes from global LTL specifications
inferred← citeshttps://doi.org/10.1109/lics.1995.523247openalex-snapshot
Model-checking of causality properties
inferred← citeshttps://doi.org/10.1145/1101908.1101913openalex-snapshot
Exploiting predicate structure for efficient reachability detection
inferred← citeshttps://doi.org/10.3233/fi-2000-41301openalex-snapshot
On Topological Hierarchies of Temporal Properties
inferred← citeshttps://doi.org/10.3233/fi-2000-43123413openalex-snapshot
Improving Partial Order Reductions for Universal Branching Time Properties
inferred← citeshttps://doi.org/10.3233/fi-2010-278openalex-snapshot
Infinite Product of Traces Represented by Projections
inferred← citeshttps://doi.org/10.7146/brics.v2i39.19941openalex-snapshot
Petri Nets, Traces, and Local Model Checking
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.