On the public citation graph
Minimal transition systems for history-preserving bisimulation
0 signed · 43 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.1006/inco.1993.1069openalex-snapshot
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
inferredcites →https://doi.org/10.1007/3-540-15204-0_14openalex-snapshot
The residue of vector sets with applications to decidability problems in petri nets
inferredcites →https://doi.org/10.1007/3-540-54233-7_158openalex-snapshot
Deciding history preserving bisimilarity
inferredcites →https://doi.org/10.1007/3-540-60218-6_4openalex-snapshot
Checking bisimilarity for finitary π-calculus
inferredcites →https://doi.org/10.1007/3-540-61055-3_42openalex-snapshot
Efficient minimization up to location equivalence
inferredcites →https://doi.org/10.1007/bf01178506openalex-snapshot
Concurrent bisimulations in Petri nets
inferredcites →https://doi.org/10.1007/bfb0013030openalex-snapshot
Partial orderings descriptions and observations of nondeterministic concurrent processes
inferredcites →https://doi.org/10.1016/0304-3975(95)00132-8openalex-snapshot
Deciding true concurrency equivalences on safe, finite nets
inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot
The non-sequential behaviour of Petri nets
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
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-45711-9_11openalex-snapshot
Bisimulation Equivalences for Graph Grammars
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_32openalex-snapshot
On Plain and Hereditary History-Preserving Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_22openalex-snapshot
Synthesis and Analysis of Petri Nets from Causal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_25openalex-snapshot
Hereditary History-Preserving Bisimilarity: Logics and Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_21openalex-snapshot
Composition and Decomposition in True-Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_17openalex-snapshot
History Preserving Bisimulation for Contextual Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_11openalex-snapshot
A Logic for True Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_38openalex-snapshot
Canonizable Partial Order Generators
inferred← citeshttps://doi.org/10.1007/bfb0028772openalex-snapshot
Verifying mobile processes in the HAL environment
inferred← citeshttps://doi.org/10.1007/bfb0035394openalex-snapshot
An automata based verification environment for mobile processes
inferred← citeshttps://doi.org/10.1007/s00236-014-0207-9openalex-snapshot
Revisiting causality, coalgebraically
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.012openalex-snapshot
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.007openalex-snapshot
Symmetries, local names and dynamic (de)-allocation of names
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.004openalex-snapshot
Reduction of event structures under history preserving bisimulation
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.08.002openalex-snapshot
Distributed semantics for the π -calculus based on Petri nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.014openalex-snapshot
Structured coalgebras and minimal HD-automata for the π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.007openalex-snapshot
Causality versus true-concurrency
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.006openalex-snapshot
Minimisation of event structures
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80297-xopenalex-snapshot
Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80298-1openalex-snapshot
Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80696-6openalex-snapshot
An Introduction to History Dependent Automata
inferred← citeshttps://doi.org/10.1145/566385.566386openalex-snapshot
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:37)2023openalex-snapshot
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5341openalex-snapshot
Canonizable Partial Order Generators and Regular Slice Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4094openalex-snapshot
A Logic for True Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7181openalex-snapshot
Reduction of Event Structures under History Preserving Bisimulation
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.