On the public citation graph
An algebraic verification of a mobile network
0 signed · 85 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-18088-5_11openalex-snapshot
Verifying a protocol using relativized bisimulation
inferredcites →https://doi.org/10.1007/3-540-54430-5_80openalex-snapshot
Modal logics for mobile processes
inferredcites →https://doi.org/10.1007/bf01211082openalex-snapshot
The formalization and analysis of a communications protocol
inferredcites →https://doi.org/10.1016/0167-6423(85)90002-4openalex-snapshot
Algebraic specification and verification of communication protocols
inferredcites →https://doi.org/10.1016/0167-6423(90)90048-iopenalex-snapshot
The formal description technique LOTOS
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/b978-0-444-89402-1.50023-0openalex-snapshot
Modelling Dynamic Communication Structures in LOTOS
inferredcites →https://doi.org/10.1016/b978-0-444-89402-1.50035-7openalex-snapshot
Specification and Validation of a Simple Overtaking Protocol using LOTOS
inferredcites →https://doi.org/10.1016/s1474-6670(17)51359-2openalex-snapshot
The Formalization and Analysis of a Communications Protocol
inferredcites →https://doi.org/10.1017/cbo9780511608841openalex-snapshot
Applications of Process Algebra
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra
inferredcites →https://doi.org/10.7146/dpb.v15i208.7559openalex-snapshot
A Calculus of Communicating Systems with Label Passing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.385openalex-snapshot
Error‐preserving reductions on communication protocols
inferred← citeshttps://doi.org/10.1006/inco.1996.0072openalex-snapshot
Model Checking Mobile Processes
inferred← citeshttps://doi.org/10.1006/inco.2000.2895openalex-snapshot
A Partition Refinement Algorithm for the π-Calculus
inferred← citeshttps://doi.org/10.1007/11417019_11openalex-snapshot
Global Computing in a Dynamic Network of Tuple Spaces
inferred← citeshttps://doi.org/10.1007/11494881_1openalex-snapshot
Pattern Matching over a Dynamic Network of Tuple Spaces
inferred← citeshttps://doi.org/10.1007/11523468_99openalex-snapshot
Basic Observables for a Calculus for Global Computing
inferred← citeshttps://doi.org/10.1007/11548133_10openalex-snapshot
Modelling Fusion Calculus using HD-Automata
inferred← citeshttps://doi.org/10.1007/11691372_3openalex-snapshot
Parameterized Verification of π-Calculus Systems
inferred← citeshttps://doi.org/10.1007/3-540-36384-x_12openalex-snapshot
A Logical Encoding of the π-Calculus: Model Checking Mobile Processes Using Tabled Resolution
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_3openalex-snapshot
Model checking mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_73openalex-snapshot
The mobility workbench — A tool for the π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_52openalex-snapshot
On the decidability of process equivalences for the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-60275-5_53openalex-snapshot
Mechanizing a π-calculus equivalence in HOL
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_153openalex-snapshot
Mobile processes with a distributed environment
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_56openalex-snapshot
A partition refinement algorithm for the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_50openalex-snapshot
Toward a modal theory of types for the π-calculus
inferred← citeshttps://doi.org/10.1007/978-0-387-35082-0_12openalex-snapshot
Using Actors as a computational model for OOram
inferred← citeshttps://doi.org/10.1007/978-3-319-14977-6_12openalex-snapshot
A Routing Calculus with Flooding Updates
inferred← citeshttps://doi.org/10.1007/978-3-540-30557-6_10openalex-snapshot
A Provably Correct Compiler for Efficient Model Checking of Mobile Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_13openalex-snapshot
From Co-algebraic Specifications to Implementation: The Mihda Toolkit
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_22openalex-snapshot
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
inferred← citeshttps://doi.org/10.1007/978-3-540-79230-7_5openalex-snapshot
Scalable Formalization of Publish/Subscribe Messaging Scheme Based on Message Brokers
inferred← citeshttps://doi.org/10.1007/978-3-642-11659-9_27openalex-snapshot
Formal Approaches to Location Management in Mobile Communications
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_19openalex-snapshot
Petruchio: From Dynamic Networks to Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-18734-6_11openalex-snapshot
The π-calculus as an Abstraction for Biomolecular Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-18734-6_3openalex-snapshot
Software Verification of Biomolecular Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_31openalex-snapshot
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-7091-6355-9_10openalex-snapshot
The Term Graph Programming System HOPS
inferred← citeshttps://doi.org/10.1007/bf01211073openalex-snapshot
A comparison of simulation techniques and algebraic techniques for verifying concurrent systems
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/s00165-021-00530-xopenalex-snapshot
A process calculus BigrTiMo of mobile systemsand its formal semantics
inferred← citeshttps://doi.org/10.1007/s10009-003-0136-3openalex-snapshot
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
inferred← citeshttps://doi.org/10.1016/0950-5849(94)90095-7openalex-snapshot
Formal methods and design extraction: a pilot study
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50023-0openalex-snapshot
Modelling Dynamic Communication Structures in LOTOS
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.031openalex-snapshot
Modelling the GSM Handover Protocol in CommUnity
inferred← citeshttps://doi.org/10.1016/j.ic.2007.03.004openalex-snapshot
Basic observables for a calculus for global computing
inferred← citeshttps://doi.org/10.1016/j.scico.2006.06.004openalex-snapshot
Global computing in a dynamic network of tuple spaces
inferred← citeshttps://doi.org/10.1016/j.scico.2010.05.010openalex-snapshot
Type inference and strong static type checking for Promela
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.021openalex-snapshot
Coalgebraic minimization of HD-automata for the π -calculus using polymorphic types
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00093-1openalex-snapshot
Names of the π-calculus agents handled locally
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00063-1openalex-snapshot
A π-calculus with explicit substitutions
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00325-8openalex-snapshot
On the decidability of process equivalences for the π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82534-4openalex-snapshot
The Maude LTL Model Checker
inferred← citeshttps://doi.org/10.1093/comjnl/41.6.386openalex-snapshot
ARC: A Specification Language for Communicating Systems
inferred← citeshttps://doi.org/10.1109/32.666824openalex-snapshot
Compositional programming abstractions for mobile computing
inferred← citeshttps://doi.org/10.1109/acsd.2012.11openalex-snapshot
Translating Structural Process Properties to Petri Net Markings
inferred← citeshttps://doi.org/10.1109/cit.2006.70openalex-snapshot
Describing and Reasoning on the Composition of Grid Services Using Pi-Calculus
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617347openalex-snapshot
TLA-style specification of a mobile network
inferred← citeshttps://doi.org/10.1109/gcc.2006.87openalex-snapshot
Specification for Concurrency and Communication Characteristic of Grid Service Composition using Pi-calculus
inferred← citeshttps://doi.org/10.1109/icatm.2001.932117openalex-snapshot
Formal specification and verification of protocol-based handover in a mobile process
inferred← citeshttps://doi.org/10.1109/icdcsw.2010.54openalex-snapshot
Verification and Performance Evaluation of S-MAC Protocol Based on Process Calculi
inferred← citeshttps://doi.org/10.1109/nca.2004.1347788openalex-snapshot
The nepi network programming system: a programming environment for distributed systems
inferred← citeshttps://doi.org/10.1109/qest.2007.27openalex-snapshot
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping
inferred← citeshttps://doi.org/10.1109/qest.2007.31openalex-snapshot
Model checking the probabilistic pi-calculus
inferred← citeshttps://doi.org/10.1109/synasc.2014.74openalex-snapshot
Expressing BBUFs Lookup Using the π-Calculus
inferred← citeshttps://doi.org/10.1109/tnet.2015.2404336openalex-snapshot
Detecting Problematic Control-Plane Protocol Interactions in Mobile Networks
inferred← citeshttps://doi.org/10.1109/tse.2008.77openalex-snapshot
Model Checking Probabilistic and Stochastic Extensions of the π-Calculus
inferred← citeshttps://doi.org/10.1109/tvt.2018.2854832openalex-snapshot
Energy-Aware Temporal Reachability Graphs for Time-Varying Mobile Opportunistic Networks
inferred← citeshttps://doi.org/10.1109/wicsa.2004.1310715openalex-snapshot
An architectural approach to mobility - the handover case study
inferred← citeshttps://doi.org/10.1142/s0218126606003416openalex-snapshot
SPECIFICATION AND VERIFICATION OF A PARAMETRIC HANDOVER PROCEDURE USING TLA
inferred← citeshttps://doi.org/10.1145/2567948.2579362openalex-snapshot
Temporal capacity graphs for time-varying mobile networks
inferred← citeshttps://doi.org/10.1145/2619239.2626302openalex-snapshot
Control-plane protocol interactions in cellular networks
inferred← citeshttps://doi.org/10.1145/2740070.2626302openalex-snapshot
Control-plane protocol interactions in cellular networks
inferred← citeshttps://doi.org/10.1145/333580.333593openalex-snapshot
Semantics study and reality of computing
inferred← citeshttps://doi.org/10.1145/990010.990013openalex-snapshot
A model-checking verification environment for mobile processes
inferred← citeshttps://doi.org/10.11606/d.45.2003.tde-20220712-120534openalex-snapshot
Uma técnica de verificação para `pi¦-calculus baseada em bi-simulação up-to e algoritmos de particionamento
inferred← citeshttps://doi.org/10.25405/ncl.34187109openalex-snapshot
A Polynomial Translation of Pi-calculus (FCP) to Safe Petri Nets
inferred← citeshttps://doi.org/10.3233/fi-2009-138openalex-snapshot
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4007openalex-snapshot
Theory and tool support for the formal verification of cryptographic protocols
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0029openalex-snapshot
A Calculus of Communicating Systems with Label Passing—Ten Years After
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.