On the public citation graph

Propositional temporal logics and equivalences

0 signed · 63 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/3-540-10235-3openalex-snapshot

A Calculus of Communicating Systems

inferredcites →https://doi.org/10.1007/3-540-17660-8_52openalex-snapshot

On the semantics of concurrency: Partial orders and transition systems

inferredcites →https://doi.org/10.1007/3-540-51486-4_71openalex-snapshot

Equivalence notions for concurrent systems and refinement of actions

inferredcites →https://doi.org/10.1007/3-540-51803-7_23openalex-snapshot

On the relation of programs and computations to models of temporal logic

inferredcites →https://doi.org/10.1007/3-540-52753-2_49openalex-snapshot

A concurrent branching time temporal logic

inferredcites →https://doi.org/10.1007/3-540-53479-2_19openalex-snapshot

On distributed languages and models for distributed computation

inferredcites →https://doi.org/10.1007/3-540-53487-3_53openalex-snapshot

Observational logics and concurrency models

inferredcites →https://doi.org/10.1007/978-1-4612-0931-7_3openalex-snapshot

Temporal Logic

inferredcites →https://doi.org/10.1007/bfb0012800openalex-snapshot

Event structure semantics for CCS and related languages

inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot

The anchored version of the temporal framework

inferredcites →https://doi.org/10.1007/bfb0013026openalex-snapshot

An introduction to event structures

inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot

Concurrency and automata on infinite sequences

inferredcites →https://doi.org/10.1007/bfb0039058openalex-snapshot

Back and forth bisimulations

inferredcites →https://doi.org/10.1007/bfb0039076openalex-snapshot

Partial order logics for elementary net systems: State- and event-approaches

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(88)90098-9openalex-snapshot

Characterizing finite Kripke structures in propositional temporal logic

inferredcites →https://doi.org/10.1016/0304-3975(89)90117-5openalex-snapshot

Event structures and domains

inferredcites →https://doi.org/10.1109/lics.1990.113739openalex-snapshot

Three logics for branching bisimulation

inferredcites →https://doi.org/10.1145/41840.41855openalex-snapshot

Interleaving set temporal logic

inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot

“Sometimes” and “not never” revisited

inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot

Automatic verification of finite state concurrent system using temporal logic specifications

inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot

"Sometime" is sometimes "not never"

inferredcites →https://doi.org/10.3233/fi-1991-14103openalex-snapshot

Modelling Nondeterministic Concurrent Processes with Event Structures

inferredcites →https://doi.org/10.7146/dpb.v20i353.6583openalex-snapshot

Transition Systems, Event Structures and Unfoldings

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11690634_17openalex-snapshot

Reversing Algebraic Process Calculi

inferred← citeshttps://doi.org/10.1007/3-540-40006-0_19openalex-snapshot

A Modal Logic for Network Topologies

inferred← citeshttps://doi.org/10.1007/3-540-45740-2_19openalex-snapshot

Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets

inferred← citeshttps://doi.org/10.1007/3-540-46017-9_4openalex-snapshot

Abstraction in Software Model Checking: Principles and Practice

inferred← citeshttps://doi.org/10.1007/3-540-48086-2_27openalex-snapshot

Automated Verification of Infinite State Concurrent Systems

inferred← citeshttps://doi.org/10.1007/3-540-48168-0_35openalex-snapshot

A Logical Viewpoint on Process-Algebraic Quotients

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-56891-3_30openalex-snapshot

B(PN) 2 — a basic Petri net programming notation

inferred← citeshttps://doi.org/10.1007/3-540-58131-6_54openalex-snapshot

Bisimulation, games, and logic

inferred← citeshttps://doi.org/10.1007/3-540-61604-7_81openalex-snapshot

Action refinement and property inheritance in systems of sequential agents

inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_9openalex-snapshot

Simulations for Multi-Agent Systems with Imperfect Information

inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_13openalex-snapshot

Deriving Inverse Operators for Modal Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_29openalex-snapshot

Bisimulation for Models in Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_20openalex-snapshot

MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-34059-8_15openalex-snapshot

A Counterexample-Based Incremental and Modular Verification Approach

inferred← citeshttps://doi.org/10.1007/978-3-642-40465-8_5openalex-snapshot

Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets

inferred← citeshttps://doi.org/10.1007/bfb0014433openalex-snapshot

Institutions for behaviour specification

inferred← citeshttps://doi.org/10.1007/bfb0015021openalex-snapshot

Bisimulation for models in concurrency mogens nielsen and christian clausen

inferred← citeshttps://doi.org/10.1007/bfb0036207openalex-snapshot

Behavioural characterizations of partial order logics

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/0020-0190(94)00065-4openalex-snapshot

Logics and decidability for labelled pre- and partially ordered Kripke structures

inferred← citeshttps://doi.org/10.1016/j.ic.2020.104552openalex-snapshot

Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol

inferred← citeshttps://doi.org/10.1016/j.jlap.2006.11.002openalex-snapshot

Reversing algebraic process calculi

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.022openalex-snapshot

Characterizing right inverses for spatial constraint systems with applications to modal logic

inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00105-7openalex-snapshot

Transition systems from event structures revisited

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00303-5openalex-snapshot

Towards a unified view of bisimulation: a comparative study

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80261-0openalex-snapshot

On Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics

inferred← citeshttps://doi.org/10.1017/s0960129513000510openalex-snapshot

Event Identifier Logic

inferred← citeshttps://doi.org/10.1093/logcom/11.5.701openalex-snapshot

Modal Logic with Bounded Quantification over Worlds

inferred← citeshttps://doi.org/10.1109/acsd.2008.4574600openalex-snapshot

Modular construction of the symbolic observation graph

inferred← citeshttps://doi.org/10.1145/3373718.3394784openalex-snapshot

A Hennessy-Milner Theorem for ATL with Imperfect Information

inferred← citeshttps://doi.org/10.13140/rg.2.2.26708.19841openalex-snapshot

Towards Partial Order Reductions for Fragments of Alternating-Time Temporal Logic

inferred← citeshttps://doi.org/10.4204/eptcs.64.8openalex-snapshot

A Logic with Reverse Modalities for History-preserving Bisimulations

inferred← citeshttps://doi.org/10.48550/arxiv.2006.15000openalex-snapshot

A Hennessy-Milner Theorem for ATL with Imperfect Information

inferred← citeshttps://doi.org/10.65109/kpbb4209openalex-snapshot

Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot

inferred← citeshttps://doi.org/10.70675/6bc651c8ze78bz45dez9b34z8fe4450cb7acopenalex-snapshot

On the expressiveness of spatial constraint systems

inferred← citeshttps://doi.org/10.70675/e2f846eezbcafz4543za309z6a60439b9888openalex-snapshot

Abstraction and modular verification of inter-enterprise business processes

inferred← citeshttps://doi.org/10.7146/brics.v1i6.21664openalex-snapshot

Bisimulations, Games, and Logic

inferred← citeshttps://doi.org/10.7146/dpb.v23i467.6940openalex-snapshot

Bisimulations, Games and 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.