On the public citation graph
Proving partial order liveness properties
0 signed · 58 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-50403-6_37openalex-snapshot
Temporal logic and causality in concurrent systems
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/bf00289262openalex-snapshot
Recursive assertions and parallel programs
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf01872848openalex-snapshot
Appraising fairness in languages for distributed programming
inferredcites →https://doi.org/10.1007/bf01887206openalex-snapshot
Event fairness and non-interleaving concurrency
inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferredcites →https://doi.org/10.1007/bfb0013032openalex-snapshot
An efficient verification method for parallel and distributed programs
inferredcites →https://doi.org/10.1007/bfb0035790openalex-snapshot
On the synthesis of an asynchronous reactive module
inferredcites →https://doi.org/10.1016/0167-6423(83)90013-8openalex-snapshot
Decomposition of distributed programs into communication-closed layers
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I
inferredcites →https://doi.org/10.1016/0304-3975(83)90082-8openalex-snapshot
Alternative semantics for temporal logics
inferredcites →https://doi.org/10.1016/0304-3975(86)90177-5openalex-snapshot
Concurrent and maximally concurrent evolution of nonsequential systems
inferredcites →https://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferredcites →https://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
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/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
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/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/800113.803634openalex-snapshot
A consistent and complete deductive system for the verification of parallel programs
inferredcites →https://doi.org/10.1145/800222.806733openalex-snapshot
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.
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-54345-7_81openalex-snapshot
Extending temporal logic by explicit concurrency
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_13openalex-snapshot
Graph grammars as context-dependent rewriting systems: A partial ordering semantics
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_45openalex-snapshot
Axiomatizations of temporal logics on trace systems
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-60043-4_62openalex-snapshot
Petri nets, traces, and local model checking
inferred← citeshttps://doi.org/10.1007/978-3-642-85983-0_8openalex-snapshot
Concurrent Semantics for Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bfb0014001openalex-snapshot
A hierarchy of partial order temporal properties
inferred← citeshttps://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferred← citeshttps://doi.org/10.1007/bfb0084792openalex-snapshot
Sometimes ‘some’ is as good as ‘all’
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90007-iopenalex-snapshot
On undecidability of propositional temporal logics on trace systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90069-6openalex-snapshot
Graph rewriting for a partial ordering semantics of concurrent constraint programming
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/s1474-6670(17)32927-0openalex-snapshot
Deriving a Fault Tolerant Real Time Program using Program Verification
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43744-xopenalex-snapshot
Constructing an Interval Temporal Logic for Real-Time System
inferred← citeshttps://doi.org/10.1023/b:time.0000027933.63133.5fopenalex-snapshot
Using Program Transformations to Provide Safety Properties for Real-Time Systems
inferred← citeshttps://doi.org/10.1109/iceccs.1995.479365openalex-snapshot
Ensuring the satisfaction of a temporal specification at run-time
inferred← citeshttps://doi.org/10.1109/lics.1991.151648openalex-snapshot
Specifying and proving serializability in temporal logic
inferred← citeshttps://doi.org/10.3233/fi-2000-41301openalex-snapshot
On Topological Hierarchies of Temporal Properties
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.