On the public citation graph
Minimizing the number of transitions with respect to observation equivalence
0 signed · 37 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-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/bf00264365openalex-snapshot
Extensional equivalences for transition systems
inferredcites →https://doi.org/10.1007/bfb0015763openalex-snapshot
A context dependent equivalence between processes
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(90)90071-kopenalex-snapshot
An implementation of an efficient algorithm for bisimulation equivalence
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(87)90007-7openalex-snapshot
A context dependent equivalence between processes
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(89)90070-9openalex-snapshot
A complete axiomatisation for observational congruence of finite-state behaviours
inferredcites →https://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/318951.319005openalex-snapshot
Modeling physical layer protocols using communicating finite state machines
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/363347.363366openalex-snapshot
Computer Systems: Reliable full-duplex file transmission over half-duplex telephone line
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
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-61363-3_3openalex-snapshot
Compositionality in state space verification methods
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-3-319-05416-2_11openalex-snapshot
Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events
inferred← citeshttps://doi.org/10.1007/s10626-012-0133-3openalex-snapshot
Conflict-preserving abstraction of discrete event systems using annotated automata
inferred← citeshttps://doi.org/10.1007/s10626-023-00378-8openalex-snapshot
A survey on compositional algorithms for verification and synthesis in supervisory control
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.035openalex-snapshot
On the Observable Behaviour of Composite Components
inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.003openalex-snapshot
The quest for minimal quotients for probabilistic and Markov automata
inferred← citeshttps://doi.org/10.1016/j.ijar.2020.12.005openalex-snapshot
Limited approximate bisimulations and the corresponding rough approximations
inferred← citeshttps://doi.org/10.1016/j.knosys.2017.11.008openalex-snapshot
Personalized graph pattern matching via limited simulation
inferred← citeshttps://doi.org/10.1016/j.scico.2015.05.010openalex-snapshot
An algorithm for compositional nonblocking verification using special events
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00281-2openalex-snapshot
Essential transitions to bisimulation equivalences
inferred← citeshttps://doi.org/10.1109/coase.2012.6386447openalex-snapshot
Transition removal for compositional supervisor synthesis
inferred← citeshttps://doi.org/10.1109/iccet.2010.5486319openalex-snapshot
Evolutionary behavior verification to the trustworthy banking software
inferred← citeshttps://doi.org/10.1109/tse.2002.1010062openalex-snapshot
Incremental integration testing of concurrent programs
inferred← citeshttps://doi.org/10.1109/wodes.2006.1678415openalex-snapshot
Modular Nonblocking Verification Using Conflict Equivalence
inferred← citeshttps://doi.org/10.1137/070695526openalex-snapshot
Compositional Verification in Supervisory Control
inferred← citeshttps://doi.org/10.5282/edoc.12075openalex-snapshot
Behaviour and Refinement of Port-Based Components with Synchronous and Asynchronous Communication
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.