On the public citation graph
Abstraction in real time process algebra
0 signed · 33 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/bfb0039069openalex-snapshot
Transition system specifications with negative premises
inferredcites →https://doi.org/10.1007/bfb0039073openalex-snapshot
A temporal calculus of communicating systems
inferredcites →https://doi.org/10.1007/bfb0039080openalex-snapshot
Real-time behaviour of asynchronous agents
inferredcites →https://doi.org/10.1007/bfb0039617openalex-snapshot
Bounded nondeterminism and the approximation induction principle in process algebra
inferredcites →https://doi.org/10.1007/bfb0040255openalex-snapshot
A hierarchy of domains for real-time distributed computing
inferredcites →https://doi.org/10.1016/0169-7552(94)00016-mopenalex-snapshot
On communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(88)90030-8openalex-snapshot
A timed model for 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/11603009_20openalex-snapshot
Is Timed Branching Bisimilarity an Equivalence Indeed?
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_4openalex-snapshot
An asynchronous process algebra with multiple clocks
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_38openalex-snapshot
Discrete time process algebra with abstraction
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_37openalex-snapshot
A calculus for timed automata
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_10openalex-snapshot
Regular processes and timed automata
inferred← citeshttps://doi.org/10.1007/978-3-319-27810-0_16openalex-snapshot
Rule Formats for Bounded Nondeterminism in Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_20openalex-snapshot
Real-Time Process Algebra and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_19openalex-snapshot
Action Abstraction in Timed Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-87563-5_4openalex-snapshot
On Mathematical Laws of Software
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot
Introduction to Process Algebra
inferred← citeshttps://doi.org/10.1007/bf01211907openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/bf01212523openalex-snapshot
Formalizing process algebraic verifications in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/s00236-020-00394-3openalex-snapshot
Sound reasoning in tock-CSP
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90197-hopenalex-snapshot
Congruent weak bisimulation with dense real-time
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.003openalex-snapshot
Formal Verification of Timed Systems Using Cones and Foci
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00010-1openalex-snapshot
Analysis of three hybrid systems in timed μCRL
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00342-4openalex-snapshot
Metric semantics for true concurrent real time
inferred← citeshttps://doi.org/10.1023/a:1020561826073openalex-snapshot
The Real-Time Process Algebra (RTPA)
inferred← citeshttps://doi.org/10.1023/a:1025457612549openalex-snapshot
Using Process Algebra to Describe Human and Software Behaviors
inferred← citeshttps://doi.org/10.1109/coginf.2002.1039298openalex-snapshot
A new mathematical notation for describing notion and thought in software design
inferred← citeshttps://doi.org/10.3233/fun-2008-873-402openalex-snapshot
Is Timed Branching Bisimilarity a Congruence Indeed?
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.