On the public citation graph
Appraising fairness in languages for distributed programming
0 signed · 164 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-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-11981-7_17openalex-snapshot
An operational semantics for CSP
inferredcites →https://doi.org/10.1007/3-540-13345-3_36openalex-snapshot
Probabilistic bidding gives optimal distributed resource allocation
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-19488-6_106openalex-snapshot
Serializability in distributed systems with handshaking
inferredcites →https://doi.org/10.1007/bf01407937openalex-snapshot
Fairness and the axioms of control predicates
inferredcites →https://doi.org/10.1016/0020-0190(87)90001-9openalex-snapshot
Two normal form theorems for CSP programs
inferredcites →https://doi.org/10.1016/0022-0000(86)90056-5openalex-snapshot
A complete rule for equifair termination
inferredcites →https://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferredcites →https://doi.org/10.1016/0167-6423(83)90004-7openalex-snapshot
Proof rules and transformations dealing with fairness
inferredcites →https://doi.org/10.1016/0167-6423(84)90018-2openalex-snapshot
A proof system for concurrent ADA programs
inferredcites →https://doi.org/10.1016/s0019-9958(85)80014-0openalex-snapshot
A proof rule for fair termination of guarded commands
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/41625.41642openalex-snapshot
Appraising fairness in distributed languages
inferredcites →https://doi.org/10.1145/44501.44504openalex-snapshot
Fairness in parallel programs: the transformational approach
inferredcites →https://doi.org/10.1145/73560.73581openalex-snapshot
A compositional approach to superimposition
inferredcites →https://doi.org/10.1145/800221.806716openalex-snapshot
Decentralization of process nets with centralized control
inferredcites →https://doi.org/10.1145/800222.806752openalex-snapshot
Fair termination of communicating processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.782openalex-snapshot
Fairness in systems based on multiparty interactions
inferred← citeshttps://doi.org/10.1006/inco.1994.1060openalex-snapshot
Temporal Proof Methodologies for Timed Transition-Systems
inferred← citeshttps://doi.org/10.1006/inco.1996.0010openalex-snapshot
A Temporal Logic for Proving Properties of Topologically General Executions
inferred← citeshttps://doi.org/10.1006/inco.2000.2886openalex-snapshot
Strong Fairness and Full Abstraction for Communicating Processes
inferred← citeshttps://doi.org/10.1006/inco.2000.3014openalex-snapshot
On Fairness Notions in Distributed Systems
inferred← citeshttps://doi.org/10.1006/inco.2000.3015openalex-snapshot
On Fairness Notions in Distributed Systems
inferred← citeshttps://doi.org/10.1007/11560647_36openalex-snapshot
Using Fairness Constraints in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_14openalex-snapshot
Liveness and Fairness in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_23openalex-snapshot
Faithful Translations Among Models and Specifications
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-45694-5_31openalex-snapshot
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
inferred← citeshttps://doi.org/10.1007/3-540-47884-1_9openalex-snapshot
A Framework for Translating Models and Specifications
inferred← citeshttps://doi.org/10.1007/3-540-48166-4_31openalex-snapshot
Checking Progress with Action Priority: Is it Fair?
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_24openalex-snapshot
Localizability of Fairness Constraints and their Distributed Implementations
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_31openalex-snapshot
Mechanizing Proofs of Computation Equivalence
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_60openalex-snapshot
Refinement calculus, part I: Sequential nondeterministic programs
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_18openalex-snapshot
Scheduling in Real-Time Models
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-58043-3_23openalex-snapshot
Verification and specification of concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_75openalex-snapshot
Proof-checking a data link protocol
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-60045-0_49openalex-snapshot
Local liveness for compositional modeling of fair reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_121openalex-snapshot
Characterizing fairness implementability for multiparty interaction
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_6openalex-snapshot
Modularity for timed and hybrid 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-1-4471-3860-0_16openalex-snapshot
Defining Conditional Independence Using Collapses
inferred← citeshttps://doi.org/10.1007/978-1-4612-3462-3_61openalex-snapshot
Petri-Net-Based Fairness Concepts for Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_29openalex-snapshot
Justness: A Completeness Criterion for Capturing Liveness Properties (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-89240-1_10openalex-snapshot
Population Protocols with Unreliable Communication
inferred← citeshttps://doi.org/10.1007/978-3-030-92875-9_1openalex-snapshot
Introduction to Process Querying
inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_8openalex-snapshot
Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-540-40981-6_18openalex-snapshot
Revisiting Liveness Properties in the Context of Secure Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_4openalex-snapshot
Specifying and Verifying Event-Based Fairness Enhanced Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_32openalex-snapshot
Modelling and Verification of Web Services Business Activity Protocol
inferred← citeshttps://doi.org/10.1007/bf00121262openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/bf01211476openalex-snapshot
On equivalence-completions of fairness assumptions
inferred← citeshttps://doi.org/10.1007/bf02242710openalex-snapshot
Some impossibility results in interprocess synchronization
inferred← citeshttps://doi.org/10.1007/bf02242712openalex-snapshot
Fairness and hyperfairness in multi-party interactions
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bf02684333openalex-snapshot
A self-stabilizing algorithm for strong fairness
inferred← citeshttps://doi.org/10.1007/bfb0013123openalex-snapshot
A characterization of fair computations of finite state SCCS processes
inferred← citeshttps://doi.org/10.1007/bfb0017489openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1007/bfb0025039openalex-snapshot
A dense-time temporal logic with nice compositionality properties
inferred← citeshttps://doi.org/10.1007/bfb0030687openalex-snapshot
Strong interaction fairness in a fully distributed system with unbounded speed variability
inferred← citeshttps://doi.org/10.1007/bfb0031985openalex-snapshot
An old-fashioned recipe for real time
inferred← citeshttps://doi.org/10.1007/bfb0032058openalex-snapshot
Proving partial order liveness properties
inferred← citeshttps://doi.org/10.1007/bfb0039063openalex-snapshot
Superimposition for interacting processes
inferred← citeshttps://doi.org/10.1007/s00165-011-0183-6openalex-snapshot
On the limits of refinement-testing for model-checking CSP
inferred← citeshttps://doi.org/10.1007/s00165-016-0376-0openalex-snapshot
Foundations for using linear temporal logic in Event-B refinement
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s001650070036openalex-snapshot
Composing and Refining Dense Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1007/s00446-003-0090-zopenalex-snapshot
Action systems in incremental and aspect-oriented modeling
inferred← citeshttps://doi.org/10.1007/s10009-012-0231-4openalex-snapshot
Model-checking web services business activity protocols
inferred← citeshttps://doi.org/10.1007/s100090050007openalex-snapshot
Real-time system = discrete system + clock variables
inferred← citeshttps://doi.org/10.1007/s11704-013-3091-5openalex-snapshot
Model checking with fairness assumptions using PAT
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90091-bopenalex-snapshot
A distributed synchronization scheme for fair multi-process handshakes
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90168-hopenalex-snapshot
Preserving liveness: Comments on “safety and liveness from a methodological point of view”
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90169-iopenalex-snapshot
Reply to the comments by M. Abadi et al.
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90005-gopenalex-snapshot
Sooner is safer than later
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90024-jopenalex-snapshot
Real-time specification and modeling with joint actions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90096-zopenalex-snapshot
Interleaving set temporal logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/j.dss.2017.04.011openalex-snapshot
Process querying: Enabling business intelligence through query-based process analytics
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105079openalex-snapshot
Modelling mutual exclusion in a process algebra with time-outs
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.001openalex-snapshot
An optimal self-stabilizing strarvation-free alternator
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.01.005openalex-snapshot
Positive Dedalus programs tolerate non-causality
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100480openalex-snapshot
Ensuring liveness properties of distributed systems: Open problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.006openalex-snapshot
Protocols with constant local storage and unreliable communication
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00074-5openalex-snapshot
Liveness, fairness, and recurrence in Petri nets
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(98)00224-2openalex-snapshot
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80087-2openalex-snapshot
Strong Fairness and Recursive Communicating Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80154-9openalex-snapshot
A Framework for Fair Communicating Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80233-6openalex-snapshot
The Semantics of Triveni: A process-Algebraic API for Threads + Events
inferred← citeshttps://doi.org/10.1017/s1471068415000381openalex-snapshot
Putting logic-based distributed systems on stable grounds
inferred← citeshttps://doi.org/10.1023/a:1006262609127openalex-snapshot
A Mechanization of Unity in PC-NQTHM-92
inferred← citeshttps://doi.org/10.1023/a:1024746015231openalex-snapshot
A Mechanized Proof Environment for the Convenient Computations Proof Method
inferred← citeshttps://doi.org/10.1080/095281300454829openalex-snapshot
Abstraction and composition: a verification method for co-operating systems
inferred← citeshttps://doi.org/10.1109/32.41333openalex-snapshot
Multiparty interactions for interprocess communication and synchronization
inferred← citeshttps://doi.org/10.1109/71.296319openalex-snapshot
Fault-tolerant algorithms for fair interprocess synchronization
inferred← citeshttps://doi.org/10.1109/71.663873openalex-snapshot
Strong interaction fairness via randomization
inferred← citeshttps://doi.org/10.1109/71.920585openalex-snapshot
Self-stabilizing strong fairness under weak fairness
inferred← citeshttps://doi.org/10.1109/csd.1998.657550openalex-snapshot
Proving correctness of distributed algorithms using high-level Petri nets-a case study
inferred← citeshttps://doi.org/10.1109/emwrt.1993.638858openalex-snapshot
Real Time: Further Misconceptions or Half-Truths
inferred← citeshttps://doi.org/10.1109/hicss.1995.375444openalex-snapshot
Modelling the client-server behaviour of parallel real-time systems using Petri nets
inferred← citeshttps://doi.org/10.1109/icdcs.1990.89279openalex-snapshot
On fairness as an abstraction for the design of distributed systems
inferred← citeshttps://doi.org/10.1109/icdcs.1996.507996openalex-snapshot
Strong interaction fairness via randomization
inferred← citeshttps://doi.org/10.1109/iwssd.1991.213073openalex-snapshot
Real-time specification and modeling with joint actions
inferred← citeshttps://doi.org/10.1109/jcit.1990.128281openalex-snapshot
Interacting processes: a language for coordinated distributed programming
inferred← citeshttps://doi.org/10.1109/lics.1991.151662openalex-snapshot
On the relationship between process algebra and input/output automata
inferred← citeshttps://doi.org/10.1109/lics.2006.49openalex-snapshot
Temporal Logics and Model Checking for Fairly Correct Systems
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470531openalex-snapshot
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom
inferred← citeshttps://doi.org/10.1109/pdse.1998.668164openalex-snapshot
Abstractions of distributed cooperation, their refinement and implementation
inferred← citeshttps://doi.org/10.1109/real.2003.1253264openalex-snapshot
Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems
inferred← citeshttps://doi.org/10.1145/1317471.1317474openalex-snapshot
Modeling fairness and starvation in concurrent systems
inferred← citeshttps://doi.org/10.1145/135419.135462openalex-snapshot
Progress measures and stack assertions for fair termination
inferred← citeshttps://doi.org/10.1145/1507195.1507203openalex-snapshot
Fairness and conspiracy concepts in concurrent systems
inferred← citeshttps://doi.org/10.1145/158439.158441openalex-snapshot
An introduction to assertional reasoning for concurrent systems
inferred← citeshttps://doi.org/10.1145/177492.177739openalex-snapshot
Coordinating first-order multiparty interactions
inferred← citeshttps://doi.org/10.1145/186025.186058openalex-snapshot
An old-fashioned recipe for real time
inferred← citeshttps://doi.org/10.1145/2220357.2220360openalex-snapshot
Defining Fairness in Reactive and Concurrent Systems
inferred← citeshttps://doi.org/10.1145/227595.227601openalex-snapshot
A comprehensive study of the complexity of multiparty interaction
inferred← citeshttps://doi.org/10.1145/2450142.2450151openalex-snapshot
Relational transducers for declarative networking
inferred← citeshttps://doi.org/10.1145/248052.248082openalex-snapshot
On strong-feasibilities of equivalence-completions
inferred← citeshttps://doi.org/10.1145/2509136.2509556openalex-snapshot
Bounded partial-order reduction
inferred← citeshttps://doi.org/10.1145/2641483.2641515openalex-snapshot
An Alternative View of Fairness in Petri Nets
inferred← citeshttps://doi.org/10.1145/2757215openalex-snapshot
Deciding Determinism with Fairness for Simple Transducer Networks
inferred← citeshttps://doi.org/10.1145/318774.319268openalex-snapshot
Checking progress with action priority
inferred← citeshttps://doi.org/10.1145/69558.69561openalex-snapshot
Synchronization of asynchronous processes in CSP
inferred← citeshttps://doi.org/10.1613/jair.1.11204openalex-snapshot
Verification of Distributed Epistemic Gossip Protocols
inferred← citeshttps://doi.org/10.29007/62s4openalex-snapshot
Decidability of Fair Termination of Gossip Protocols
inferred← citeshttps://doi.org/10.4204/eptcs.215.5openalex-snapshot
Epistemic Protocols for Distributed Gossiping
inferred← citeshttps://doi.org/10.4204/eptcs.59.10openalex-snapshot
Amending Contracts for Choreographies
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:27)2022openalex-snapshot
Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
inferred← citeshttps://doi.org/10.48550/arxiv.1501.03268openalex-snapshot
Progress, Fairness and Justness in Process Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1909.00286openalex-snapshot
Justness: A Completeness Criterion for Capturing Liveness Properties
inferred← citeshttps://doi.org/10.5220/0005098301150120openalex-snapshot
Measurement of Fairness in Process Models Using Entropy and Stochastic Petri Nets
inferred← citeshttps://doi.org/10.5287/ora-avknpod8qopenalex-snapshot
Analysing the Security Properties of Object−Capability Patterns
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.12openalex-snapshot
Deciding Correctness with Fairness for Simple Transducer Networks
inferred← citeshttps://doi.org/10.5555/952786.952800openalex-snapshot
Real-time specification and modeling with joint actions
inferred← citeshttps://doi.org/10.7250/csimq.2021-27.01openalex-snapshot
Control-Flow-Based Methods to Support the Development of Sound Workflows
inferred← citeshttps://doi.org/10.7561/sacs.2012.1.61openalex-snapshot
Three Algorithms and a Methodology for Amending Contracts for Choreographies
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.