On the public citation graph
Bisimulation and action refinement
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.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
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-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
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-52282-4_51openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
inferredcites →https://doi.org/10.1007/3-540-52559-9_68openalex-snapshot
Refinement of actions in causality based models
inferredcites →https://doi.org/10.1007/3-540-55511-0_19openalex-snapshot
On relating concurrency and nondeterminism
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf01798961openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
inferredcites →https://doi.org/10.1007/bfb0013034openalex-snapshot
Fully abstract models for a process language with refinement
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0020808openalex-snapshot
Bisimulation and action refinement
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(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/0304-3975(92)90298-topenalex-snapshot
Maximality preserving bisimulation
inferredcites →https://doi.org/10.1016/0304-3975(93)90157-oopenalex-snapshot
Bisimulation and action refinement
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.3117openalex-snapshot
The Box Algebra=Petri Nets+Process Expressions
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_158openalex-snapshot
Deciding history preserving bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_128openalex-snapshot
Back and forth bisimulations on prime event structures
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_169openalex-snapshot
Interleaving semantics and action refinement with atomic choice
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_170openalex-snapshot
Maximality preservation and the ST-idea for action refinements
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_176openalex-snapshot
Partial words versus processes: A short comparison
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_3openalex-snapshot
Place bisimulations in Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_99openalex-snapshot
Deciding true concurrency equivalences on finite safe nets (preliminary report)
inferred← citeshttps://doi.org/10.1007/978-3-319-00560-7_37openalex-snapshot
Maximality-Based Labeled Transition Systems Normal Form
inferred← citeshttps://doi.org/10.1007/bfb0014429openalex-snapshot
Transactions in object-oriented specifications
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(95)00132-8openalex-snapshot
Deciding true concurrency equivalences on safe, finite nets
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.1109/iceccs.2005.79openalex-snapshot
The Preservation of Interleaving Equivalences
inferred← citeshttps://doi.org/10.1109/lics.1993.287567openalex-snapshot
Self-synchronization of concurrent processes
inferred← citeshttps://doi.org/10.1109/pnpm.1991.238797openalex-snapshot
Overview of the results of the Esprit basic research action DEMON-design methods based on nets
inferred← citeshttps://doi.org/10.1145/268999.269004openalex-snapshot
Compositional refinement of interactive systems
inferred← citeshttps://doi.org/10.1587/transinf.2015inp0017openalex-snapshot
Behavioral Equivalence of Security-Oriented Interactive Systems
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:3)2008openalex-snapshot
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
inferred← citeshttps://doi.org/10.3990/1.9789090074610openalex-snapshot
Architectural notes: a framework for distributed systems development
showing the first 22 of 23 · page through all 23
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.