On the public citation graph
Back and forth bisimulations
0 signed · 88 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-12896-4_381openalex-snapshot
Property preserving homomorphisms of transition systems
inferredcites →https://doi.org/10.1007/3-540-18088-5_8openalex-snapshot
Another look at abstraction in process algebra
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0022-0000(87)90025-0openalex-snapshot
Bisimulations and abstraction homomorphisms
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
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/0890-5401(89)90054-0openalex-snapshot
An algebraic characterization of transition system equivalences
inferredcites →https://doi.org/10.1016/b978-0-12-046370-1.50014-0openalex-snapshot
Canonical Representatives for Observational Equivalence Classes
inferredcites →https://doi.org/10.1016/s0019-9958(85)80025-5openalex-snapshot
The power of the future perfect in program logics
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
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.1996.0047openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
inferred← citeshttps://doi.org/10.1007/11690634_17openalex-snapshot
Reversing Algebraic Process Calculi
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_32openalex-snapshot
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_3openalex-snapshot
Improving the Verification of Timed Systems Using Influence Information
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_30openalex-snapshot
Hereditary History Preserving Bisimilarity Is Undecidable
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_38openalex-snapshot
Back-forth equivalences for design of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_31openalex-snapshot
Translation Results for Modal Logics of Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_26openalex-snapshot
A Framework for Provenance-Preserving History Distribution and Incremental Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-79837-6_8openalex-snapshot
Forward-Reverse Observational Equivalences in CCSK
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_6openalex-snapshot
Back-and-Forth in Space: On Logics and Bisimilarity in Closure Spaces
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_21openalex-snapshot
On Probabilistic Extension of the Interaction Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_13openalex-snapshot
Reverse Bisimilarity vs. Forward Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_5openalex-snapshot
Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-42626-1_2openalex-snapshot
Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time Additivity
inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_3openalex-snapshot
Noninterference Analysis of Reversible Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-68279-7_8openalex-snapshot
A Matrix-Oriented View of Bisimulation Quotients over Dioid-Labeled Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-68416-6_8openalex-snapshot
Dissimilarity for Linear Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-77019-7_15openalex-snapshot
Reversibility in Process Calculi with Nondeterminism and Probabilities
inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_4openalex-snapshot
Alternative Characterizations of Hereditary History-Preserving Bisimilarity via Backward Ready Multisets
inferred← citeshttps://doi.org/10.1007/978-3-031-95497-9_5openalex-snapshot
Noninterference Analysis of Stochastically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_16openalex-snapshot
Noninterference Analysis of Deterministically Timed Reversible Systems
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-319-69483-2_11openalex-snapshot
Remark on Some $$\pi $$ Variants
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-642-17164-2_28openalex-snapshot
Model Independent Order Relations for Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_3openalex-snapshot
Decompositional Reasoning about the History of Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-30767-6_17openalex-snapshot
A Fully Abstract View for Local Cause Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_23openalex-snapshot
Checking Equality and Regularity for Normed BPA with Silent Moves
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_11openalex-snapshot
The Value-Passing Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_31openalex-snapshot
Branching Bisimilarity Checking for PRS
inferred← citeshttps://doi.org/10.1007/bf01213078openalex-snapshot
Compositional refinements in multiple blackboard systems
inferred← citeshttps://doi.org/10.1007/bfb0032063openalex-snapshot
An efficient algorithm for branching bisimulation and stuttering equivalence
inferred← citeshttps://doi.org/10.1007/bfb0036207openalex-snapshot
Behavioural characterizations of partial order logics
inferred← citeshttps://doi.org/10.1007/bfb0084794openalex-snapshot
Propositional temporal logics and equivalences
inferred← citeshttps://doi.org/10.1007/s10009-005-0194-9openalex-snapshot
CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90081-ropenalex-snapshot
τ-Bisimulations and full abstraction for refinement of actions
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/j.ic.2017.12.001openalex-snapshot
Distinguishing between communicating transactions
inferred← citeshttps://doi.org/10.1016/j.ins.2010.07.008openalex-snapshot
A pure labeled transition semantics for the applied pi calculus
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105947openalex-snapshot
Raiders of the lost equivalence: Probabilistic branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.03.004openalex-snapshot
Reversible session-based pi-calculus
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.08.004openalex-snapshot
Contextual equivalences in configuration structures and reversibility
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.019openalex-snapshot
Reversibility in the higher-order π-calculus
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.1017/s0960129509990272openalex-snapshot
Tree-functors, determinacy and bisimulations
inferred← citeshttps://doi.org/10.1017/s0960129511000375openalex-snapshot
Characteristic formulae for fixed-point semantics: a general framework
inferred← citeshttps://doi.org/10.1017/s0960129511000429openalex-snapshot
A hierarchy of reverse bisimulations on stable configuration structures
inferred← citeshttps://doi.org/10.1109/csae.2012.6272758openalex-snapshot
A new approach to proving local cause bisimulation axiomatically
inferred← citeshttps://doi.org/10.1109/icse.2007.50openalex-snapshot
Matching and Merging of Statecharts Specifications
inferred← citeshttps://doi.org/10.1109/lics.2013.45openalex-snapshot
A Compositional Semantics for the Reversible p-Calculus
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175697openalex-snapshot
Minimization of Dynamical Systems over Monoids
inferred← citeshttps://doi.org/10.1109/tase.2012.32openalex-snapshot
An Improved Full Abstraction Approach to Analyzing Locality Semantics
inferred← citeshttps://doi.org/10.1109/tse.2011.112openalex-snapshot
Matching and Merging of Variant Feature Specifications
inferred← citeshttps://doi.org/10.1145/201019.201032openalex-snapshot
Three logics for branching bisimulation
inferred← citeshttps://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferred← citeshttps://doi.org/10.1186/s40064-016-3229-7openalex-snapshot
RETRACTED ARTICLE: An algebra of reversible computation
inferred← citeshttps://doi.org/10.4204/eptcs.18.5openalex-snapshot
Reverse Bisimulations on Stable Configuration Structures
inferred← citeshttps://doi.org/10.4204/eptcs.300.6openalex-snapshot
Conflict vs Causality in Event Structures
inferred← citeshttps://doi.org/10.4204/eptcs.347.1openalex-snapshot
Processes, Systems and Tests: Defining Contextual Equivalences
inferred← citeshttps://doi.org/10.4204/eptcs.390.5openalex-snapshot
Modal Logic Characterizations of Forward, Reverse, and Forward-Reverse Bisimilarities
inferred← citeshttps://doi.org/10.4204/eptcs.412.5openalex-snapshot
Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings
inferred← citeshttps://doi.org/10.4204/eptcs.64.8openalex-snapshot
A Logic with Reverse Modalities for History-preserving Bisimulations
inferred← citeshttps://doi.org/10.4204/eptcs.8.1openalex-snapshot
Characteristic Formulae for Fixed-Point Semantics: A General Framework
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.226openalex-snapshot
Forward and Backward Bisimulations for Chemical Reaction Networks
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:6)2023openalex-snapshot
Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:11)2024openalex-snapshot
revTPL: The Reversible Temporal Process Language
inferred← citeshttps://doi.org/10.48550/arxiv.2005.05578openalex-snapshot
Towards Spatial Bisimilarity for Closure Models: Logical and Coalgebraic Characterisations
inferred← citeshttps://doi.org/10.70675/6bc651c8ze78bz45dez9b34z8fe4450cb7acopenalex-snapshot
On the expressiveness of spatial constraint systems
inferred← citeshttps://doi.org/10.70675/fe736681zf93az4913z8413z35392a6aabd4openalex-snapshot
Réversibilité dans le pi calcul d'ordre supérieur
inferred← citeshttps://doi.org/10.7146/brics.v2i56.19957openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
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.