On the public citation graph

Rooted Branching Bisimulation as a Congruence

https://doi.org/10.1006/jcss.1999.1663

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.

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.1006/inco.1996.0030openalex-snapshot

Ntyft/ntyxt Rules Reduce to Ntree Rules

inferredcites →https://doi.org/10.1006/inco.1998.2729openalex-snapshot

A Conservative Look at Operational Semantics with Variable Binding

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-18088-5_8openalex-snapshot

Another look at abstraction in process algebra

inferredcites →https://doi.org/10.1007/3-540-54233-7_157openalex-snapshot

The meaning of negative premises in transition system specifications

inferredcites →https://doi.org/10.1007/3-540-57208-2_33openalex-snapshot

A congruence theorem for structured operational semantics with predicates

inferredcites →https://doi.org/10.1007/3-540-57208-2_6openalex-snapshot

The linear time — Branching time spectrum II

inferredcites →https://doi.org/10.1007/3-540-61440-0_154openalex-snapshot

The meaning of negative premises in transition system specifications II

inferredcites →https://doi.org/10.1007/978-3-540-48654-1_32openalex-snapshot

A congruence theorem for structured operational semantics with predicates and negative premises

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

When is partial trace equivalence adequate?

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

Concurrency and automata on infinite sequences

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

Formats of ordered SOS rules with silent actions

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

The linear time - branching time spectrum

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

Bounded nondeterminism and the approximation induction principle in process algebra

inferredcites →https://doi.org/10.1016/0020-0190(96)00034-8openalex-snapshot

Branching bisimilarity is an equivalence indeed!

inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot

Communication and concurrency

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

Term-rewriting systems with rule priorities

inferredcites →https://doi.org/10.1016/0304-3975(93)90111-6openalex-snapshot

Transition system specifications with negative premises

inferredcites →https://doi.org/10.1016/0304-3975(94)00152-9openalex-snapshot

Structural operational semantics for weak bisimulations

inferredcites →https://doi.org/10.1016/0890-5401(92)90013-6openalex-snapshot

Structured operational semantics and bisimulation as a congruence

inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot

On the Declarative Semantics of Deductive Databases and Logic Programs

inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot

Processes and the denotational semantics of concurrency

inferredcites →https://doi.org/10.1016/s0304-3975(96)00250-2openalex-snapshot

The algebra of communicating processes with empty process

inferredcites →https://doi.org/10.1016/s0304-3975(97)00283-1openalex-snapshot

Operational semantics of rewriting with priorities

inferredcites →https://doi.org/10.1016/s0304-3975(98)00267-9openalex-snapshot

Language preorder as a precongruence

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

On the relationship between process algebra and input/output automata

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

Equivalences on observable processes

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

The well-founded semantics for general logic programs

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

Bisimulation can't be traced

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

Branching time and abstraction in bisimulation semantics

inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot

Representation of Events in Nerve Nets and Finite Automata

inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot

A lattice-theoretical fixpoint theorem and its applications

inferredcites →https://doi.org/10.3233/fi-1986-9202openalex-snapshot

Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1

inferredcites →https://doi.org/10.3233/fi-1990-13404openalex-snapshot

Well-Founded Semantics Coincides with Three-Valued Stable Semantics1

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.2002.3161openalex-snapshot

Ordered SOS Process Languages for Branching and Eager Bisimulations

inferred← citeshttps://doi.org/10.1007/11560647_21openalex-snapshot

On Cool Congruence Formats for Weak Bisimulations

inferred← citeshttps://doi.org/10.1007/11804192_10openalex-snapshot

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

inferred← citeshttps://doi.org/10.1007/3-540-36575-3_10openalex-snapshot

Rule Formats for Non Interference

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_21openalex-snapshot

Process Languages for Rooted Eager Bisimulation

inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_3openalex-snapshot

Process Algebra: An Algebraic Theory of Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot

Introduction to Process Algebra

inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot

Structural Operational Semantics

inferred← citeshttps://doi.org/10.1007/s00236-003-0111-1openalex-snapshot

Structural operational semantics and bounded nondeterminism

inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot

Structural Operational Semantics

inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50023-0openalex-snapshot

Process Algebra with Recursive Operations

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.029openalex-snapshot

Divide and Congruence Applied to η-Bisimulation

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.077openalex-snapshot

A Hierarchy of SOS Rule Formats

inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.016openalex-snapshot

Notes on Generative Probabilistic Bisimulation

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

Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity

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

A general SOS theory for the specification of probabilistic transition systems

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

Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity

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

Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence

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.2016.08.005openalex-snapshot

Some undecidable properties of SOS specifications

inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100480openalex-snapshot

Ensuring liveness properties of distributed systems: Open problems

inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100929openalex-snapshot

Back to the format: A survey on SOS for probabilistic processes

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

Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation

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

Rule formats for compositional non-interference properties

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

A precongruence format for should testing preorder

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

SOS formats and meta-theory: 20 years after

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

Operational semantics for Petri net components

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

Non-expansive ϵ -bisimulations for probabilistic processes

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

On cool congruence formats for weak bisimulations

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

Probabilistic divide & congruence: Branching bisimilarity

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

Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis

inferred← citeshttps://doi.org/10.1093/comjnl/bxn009openalex-snapshot

Congruence Formats for Weak Readiness Equivalence and Weak Possible Future Equivalence

inferred← citeshttps://doi.org/10.1109/itcs.2009.275openalex-snapshot

Branching Bisimulations for Higher Order p-Calculus

inferred← citeshttps://doi.org/10.1109/lics.2017.8005142openalex-snapshot

Lean and full congruence formats for recursion

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

Divide and Congruence II

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

Precongruence formats for decorated trace semantics

inferred← citeshttps://doi.org/10.3233/fi-2014-1128openalex-snapshot

A Specification Format for Rooted Branching Bisimulation

inferred← citeshttps://doi.org/10.3233/fun-2008-873-402openalex-snapshot

Is Timed Branching Bisimilarity a Congruence Indeed?

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

SOS rule formats for convex and abstract probabilistic bisimulations

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

Rooted branching bisimulation as a congruence for probabilistic transition systems

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

A Declarative Validator for GSOS Languages

inferred← citeshttps://doi.org/10.46298/lmcs-17(3:15)2021openalex-snapshot

Relating Apartness and Bisimulation

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

Ensuring Liveness Properties of Distributed Systems (A Research Agenda)

inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot

Structural Operational Semantics

inferred← citeshttps://doi.org/10.7146/dpb.v30i553.7110openalex-snapshot

Workshop on Modelling of Objects, Components, and Agents, Aarhus, Denmark, August 27-28, 2001

inferred← citeshttps://doi.org/10.7561/sacs.2022.1.137openalex-snapshot

Imperative Process Algebra with Abstraction

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.