On the public citation graph
Behavioural equivalence relations induced by programming logics
0 signed · 80 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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0029355openalex-snapshot
The specification of process synchronization by path expressions
inferredcites →https://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferredcites →https://doi.org/10.1016/s0019-9958(83)80039-4openalex-snapshot
Connections between two theories of concurrency: Metric spaces and synchronization trees
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1109/sfcs.1980.35openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1109/sfcs.1981.44openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
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-12896-4_381openalex-snapshot
Property preserving homomorphisms of transition systems
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_20openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_14openalex-snapshot
Bisimulations and abstraction homomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_4openalex-snapshot
Process algebra with asynchronous communication mechanisms
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_31openalex-snapshot
Transition graphs semantics and languages
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_133openalex-snapshot
Computations, residuals, and the power of indeterminacy
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-50325-0_9openalex-snapshot
Observing nondeterministic data types
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_19openalex-snapshot
Comparing linear and branching time temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_75openalex-snapshot
On the weak adequacy of branching-time temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_3openalex-snapshot
Compositionality in state space verification methods
inferred← citeshttps://doi.org/10.1007/3-540-62686-7_33openalex-snapshot
Constructing finite state implementations of knowledge-based programs with perfect recall (Extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_22openalex-snapshot
Failure-based Equivalences Are Faster Than Many Believe
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_15openalex-snapshot
Hennessy-Milner Logic with recursion as a specification language, and a refinement calculus based on it
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_16openalex-snapshot
Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-05416-2_11openalex-snapshot
Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_36openalex-snapshot
Interface as a Basic Concept for Systems Specification and Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_13openalex-snapshot
A Logic for the Specification and Proof of Controllable Processes of CCS
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_9openalex-snapshot
Notes on Algebraic Calculi of Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_6openalex-snapshot
Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems
inferred← citeshttps://doi.org/10.1007/bf00263649openalex-snapshot
Non-deterministic data types: models and implementations
inferred← citeshttps://doi.org/10.1007/bf00264365openalex-snapshot
Extensional equivalences for transition systems
inferred← citeshttps://doi.org/10.1007/bf00288467openalex-snapshot
A logic for the specification and proof of regular controllable processes of CCS
inferred← citeshttps://doi.org/10.1007/bf01887208openalex-snapshot
A refinement calculus for specifications in Hennessy-Milner logic with recursion
inferred← citeshttps://doi.org/10.1007/bfb0000467openalex-snapshot
On the specification and verification of performance properties for a timed process algebra
inferred← citeshttps://doi.org/10.1007/bfb0014324openalex-snapshot
A study on the specification and verification of performance properties
inferred← citeshttps://doi.org/10.1007/bfb0015763openalex-snapshot
A context dependent equivalence between processes
inferred← citeshttps://doi.org/10.1007/bfb0015773openalex-snapshot
A complete compositional modal proof system for a subset of CCS
inferred← citeshttps://doi.org/10.1007/bfb0023774openalex-snapshot
A fragment of first order logic adequate for observation equivalence
inferred← citeshttps://doi.org/10.1007/bfb0023775openalex-snapshot
Ordinal processes in comparative concurrency semantics
inferred← citeshttps://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1007/bfb0030311openalex-snapshot
The power of the future perfect in program logics
inferred← citeshttps://doi.org/10.1007/bfb0035859openalex-snapshot
An automaton characterization of fairness in SCCS
inferred← citeshttps://doi.org/10.1007/s00236-018-0317-xopenalex-snapshot
Verification of asynchronous systems with an unspecified component
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90025-0openalex-snapshot
Bisimulations and abstraction homomorphisms
inferred← citeshttps://doi.org/10.1016/0096-0551(91)90010-7openalex-snapshot
Modular verification of Ada generics
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90004-0openalex-snapshot
A logical characterization of observation equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90065-0openalex-snapshot
Stable families of behavioural equivalences
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00204-vopenalex-snapshot
Translations between modal logics of reactive systems
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90026-6openalex-snapshot
Reasoning about networks with many identical finite state processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.037openalex-snapshot
Bisimilar and logically equivalent programs in PDL with parallel operator
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80009-7openalex-snapshot
On the relationships between Scott domains, synchronization trees, and metric spaces
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80031-6openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferred← citeshttps://doi.org/10.1017/s0960129500000189openalex-snapshot
Quantales, observational logic and process semantics
inferred← citeshttps://doi.org/10.1051/ita/1989230100591openalex-snapshot
Fairness and regularity for SCCS processes
inferred← citeshttps://doi.org/10.1051/ita/1989230100591/pdfopenalex-snapshot
Fairness and regularity for SCCS processes
inferred← citeshttps://doi.org/10.1109/coase.2013.6654014openalex-snapshot
Compositional nonblocking verification for extended finite-state automata using partial unfolding
inferred← citeshttps://doi.org/10.1109/iscc.1998.702643openalex-snapshot
Comparative analysis of the notions of equivalence for process specifications
inferred← citeshttps://doi.org/10.1109/tac.2013.2283109openalex-snapshot
A Framework for Compositional Synthesis of Modular Nonblocking Supervisors
inferred← citeshttps://doi.org/10.1142/s0129054113500287openalex-snapshot
COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA
inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks
inferred← citeshttps://doi.org/10.3182/20121003-3-mx-4033.00040openalex-snapshot
An Algorithm for Weak Synthesis Observation Equivalence for Compositional Supervisor Synthesis
inferred← citeshttps://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for 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.