On the public citation graph
An automata based verification environment for mobile processes
0 signed · 40 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-53479-2_17openalex-snapshot
Action versus state based logics for transition systems
inferredcites →https://doi.org/10.1007/3-540-54430-5_80openalex-snapshot
Modal logics for mobile processes
inferredcites →https://doi.org/10.1007/3-540-57208-2_10openalex-snapshot
A theory of bisimulation for the π-calculus
inferredcites →https://doi.org/10.1007/3-540-57208-2_3openalex-snapshot
Model checking mobile processes
inferredcites →https://doi.org/10.1007/3-540-58179-0_73openalex-snapshot
The mobility workbench — A tool for the π-Calculus
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/bf01211473openalex-snapshot
An algebraic verification of a mobile network
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1007/bfb0023477openalex-snapshot
Minimal transition systems for history-preserving bisimulation
inferredcites →https://doi.org/10.1007/s002360050036openalex-snapshot
A theory of bisimulation for the π-calculus
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/s0304-3975(96)00063-1openalex-snapshot
A π-calculus with explicit substitutions
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11419822_1openalex-snapshot
History-Dependent Automata: An Introduction
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_52openalex-snapshot
π-Calculus, Structured Coalgebras, and Minimal HD-Automata
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_10openalex-snapshot
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_18openalex-snapshot
Finite State Verification for the Asynchronous π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_1openalex-snapshot
Model Checking for Nominal Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-39425-9_26openalex-snapshot
A Proof Assistant for Mobile Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_38openalex-snapshot
Ugo Montanari and Software Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_39openalex-snapshot
History Dependent Automata for Service Compatibility
inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_17openalex-snapshot
Translating Pi-Calculus into LOTOS NT
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_14openalex-snapshot
PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_17openalex-snapshot
A Model Checking Algorithm for π-Calculus Agents
inferred← citeshttps://doi.org/10.1007/bfb0028772openalex-snapshot
Verifying mobile processes in the HAL environment
inferred← citeshttps://doi.org/10.1007/bfb0035375openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/s100090100041openalex-snapshot
Bisimulation verification using the up to techniques
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.015openalex-snapshot
A Translation from Object-Based Hypergraph Grammars into π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.092openalex-snapshot
A Calculus for Generation, Verification and Refinement of BPEL Specifications
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/s1571-0661(05)80696-6openalex-snapshot
An Introduction to History Dependent Automata
inferred← citeshttps://doi.org/10.1109/tsc.2015.2449850openalex-snapshot
Using π-calculus for Formal Modeling and Verification of WS-CDL Choreographies
inferred← citeshttps://doi.org/10.4204/eptcs.304.9openalex-snapshot
On Learning Nominal Automata with Binders
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.