On the public citation graph

Descriptively complete process logic

https://doi.org/10.1007/bf00286492
0 signed · 56 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/bfb0022460openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1007/bfb0022461openalex-snapshot
Modal logic of concurrent nondeterministic programs
inferredcites →https://doi.org/10.1016/0020-0190(79)90022-xopenalex-snapshot
Two results on process logic
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/sfcs.1978.2openalex-snapshot
A decidability result for a second order process logic
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567752.567761openalex-snapshot
Process logic
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
inferredcites →https://doi.org/10.2307/2273958openalex-snapshot
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs.…

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_4openalex-snapshot
Propositional dynamic logics of programs: A survey
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_22openalex-snapshot
On axiomatization of process logic
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_383openalex-snapshot
Yet another process logic
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_10openalex-snapshot
Model theory of propositional logics of programs, some open problems
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_22openalex-snapshot
dTL2: Differential Temporal Dynamic Logic with Nested Temporalities for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39992-3_22openalex-snapshot
Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL*
inferred← citeshttps://doi.org/10.1007/978-3-662-48561-3_14openalex-snapshot
Trace Semantics for IPDL
inferred← citeshttps://doi.org/10.1007/978-94-009-6259-0_10openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_2openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bf01888216openalex-snapshot
Branching versus linear logics yet again
inferred← citeshttps://doi.org/10.1007/bfb0015772openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90003-4openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90225-7openalex-snapshot
Process logic with regular formulas
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/b978-0-934613-67-5.50009-5openalex-snapshot
Reasoning About Plans and Actions
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80025-4openalex-snapshot
Deterministic process logic is elementary
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00039-6openalex-snapshot
Dynamic linear time temporal logic
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80027-0openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1093/logcom/exv025openalex-snapshot
Commands changing obligations 1
inferred← citeshttps://doi.org/10.1093/logcom/exy008openalex-snapshot
A temporal dynamic deontic logic
inferred← citeshttps://doi.org/10.1109/sfcs.1980.35openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferred← citeshttps://doi.org/10.1109/sfcs.1982.16openalex-snapshot
Deterministic process logic is elementary
inferred← citeshttps://doi.org/10.1109/sfcs.1982.66openalex-snapshot
Deterministic process logic is elementary
inferred← citeshttps://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferred← citeshttps://doi.org/10.1137/0213051openalex-snapshot
Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
inferred← citeshttps://doi.org/10.1137/0214066openalex-snapshot
Equations between Regular Terms and an Application to Process Logic
inferred← citeshttps://doi.org/10.1145/115234.115351openalex-snapshot
A propositional modal logic of time intervals
inferred← citeshttps://doi.org/10.1145/1562814.1562822openalex-snapshot
BMS revisited
inferred← citeshttps://doi.org/10.1145/22145.22173openalex-snapshot
Improved upper and lower bounds for modal logics of programs
inferred← citeshttps://doi.org/10.1145/23005.23008openalex-snapshot
Concurrent dynamic logic
inferred← citeshttps://doi.org/10.1145/2908080.2908108openalex-snapshot
Temporal NetKAT
inferred← citeshttps://doi.org/10.1145/2980983.2908108openalex-snapshot
Temporal NetKAT
inferred← citeshttps://doi.org/10.1145/3447928.3456648openalex-snapshot
A program logic to verify signal temporal logic specifications of hybrid systems
inferred← citeshttps://doi.org/10.1145/582153.582189openalex-snapshot
Is the interesting part of process logic uninteresting?
inferred← citeshttps://doi.org/10.1145/800076.802493openalex-snapshot
Equations between regular terms and an application to process logic
inferred← citeshttps://doi.org/10.2307/2273688openalex-snapshot
Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium)
inferred← citeshttps://doi.org/10.2977/prims/1195184022openalex-snapshot
Prepositional Dynamic Logic for Concurrent Programs
inferred← citeshttps://doi.org/10.3233/fi-1995-2441openalex-snapshot
AXIOMATIZATIONS OF INTERVAL LOGICS
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08117openalex-snapshot
A Program Logic to Verify Signal Temporal Logic Specifications of Hybrid Systems: Extended Technical Report
inferred← citeshttps://doi.org/10.7146/brics.v4i8.18798openalex-snapshot
Dynamic Linear Time Temporal Logic
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.