On the public citation graph

Verification of parallel systems via decomposition

https://doi.org/10.1007/bfb0084783
0 signed · 46 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.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-54430-5_107openalex-snapshot
Efficient verification of determinate processes
inferredcites →https://doi.org/10.1007/3-540-55179-4_18openalex-snapshot
“On the fly” verification of behavioural equivalences and preorders
inferredcites →https://doi.org/10.1007/3-540-55719-9_115openalex-snapshot
Checking equivalences between concurrent systems of finite agents (Extended abstract)
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/bfb0023733openalex-snapshot
Minimal model generation
inferredcites →https://doi.org/10.1007/bfb0032063openalex-snapshot
An efficient algorithm for branching bisimulation and stuttering equivalence
inferredcites →https://doi.org/10.1007/bfb0035774openalex-snapshot
Structured operational semantics and bisimulation as a congruence
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/0169-7552(94)00016-mopenalex-snapshot
On communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(85)90028-3openalex-snapshot
Determinancy → (observation equivalence = trace equivalence)
inferredcites →https://doi.org/10.1016/0304-3975(93)90176-topenalex-snapshot
Unique decomposition of processes
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/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1017/cbo9780511624193openalex-snapshot
Process Algebra
inferredcites →https://doi.org/10.1090/dimacs/003/08openalex-snapshot
Minimal model generation
inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

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.1997.2661openalex-snapshot
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_17openalex-snapshot
Synthesizing Distributed Transition Systems from Global Specifications
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_8openalex-snapshot
Hierarchical High Level Petri Nets for complex system analysis
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_4openalex-snapshot
Decidability results in automata and process theory
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_13openalex-snapshot
Structural Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-031-30826-0openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-031-30826-0_3openalex-snapshot
Compositional Automata Learning of Synchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-47963-2_15openalex-snapshot
Realisability of Global Models of Interaction
inferred← citeshttps://doi.org/10.1007/978-3-031-62697-5_10openalex-snapshot
Team Automata: Overview and Roadmap
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_10openalex-snapshot
A Geometric Approach to the Problem of Unique Decomposition of Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_8openalex-snapshot
Hardness of Preorder Checking for Basic Formalisms
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_18openalex-snapshot
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_4openalex-snapshot
On Unique Decomposition of Processes in the Applied π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-43613-4_14openalex-snapshot
Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction
inferred← citeshttps://doi.org/10.1007/s00236-008-0088-xopenalex-snapshot
Hardness of equivalence checking for composed finite-state systems
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00019-0openalex-snapshot
Model checking using net unfoldings
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100858openalex-snapshot
Decomposing monolithic processes in a process algebra with multi-actions
inferred← citeshttps://doi.org/10.1016/j.scico.2014.02.017openalex-snapshot
A procedure for splitting data-aware processes and its application to coordination
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.11.019openalex-snapshot
Decomposition orders—another generalisation of the fundamental theorem of arithmetic
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.037openalex-snapshot
Hardness of preorder checking for basic formalisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.013openalex-snapshot
Unique parallel decomposition in branching and weak bisimulation semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.033openalex-snapshot
On the existence and decidability of unique decompositions of processes in the applied π-calculus
inferred← citeshttps://doi.org/10.1109/43.372367openalex-snapshot
A simple theorem prover based on symbolic trajectory evaluation and BDD's
inferred← citeshttps://doi.org/10.1145/2856636.2856652openalex-snapshot
An efficient path based equivalence checking for Petri net based models of programs
inferred← citeshttps://doi.org/10.1145/3839234openalex-snapshot
A Comprehensive History of μCRL and mCRL2
inferred← citeshttps://doi.org/10.4204/eptcs.222.4openalex-snapshot
Unique Parallel Decomposition for the Pi-calculus
inferred← citeshttps://doi.org/10.4204/eptcs.347.4openalex-snapshot
Decomposing Monolithic Processes in a Process Algebra with Multi-actions
inferred← citeshttps://doi.org/10.48550/arxiv.2012.06468openalex-snapshot
Decompositional Minimisation of Monolithic Processes
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.