On the public citation graph

Discrete time process algebra

https://doi.org/10.1007/bfb0084806
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.
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/978-3-540-48654-1_32openalex-snapshot
A congruence theorem for structured operational semantics with predicates and negative premises
inferredcites →https://doi.org/10.1007/bf01211247openalex-snapshot
Real space process algebra
inferredcites →https://doi.org/10.1007/bf01215407openalex-snapshot
On sequential composition, action prefixes and process prefix
inferredcites →https://doi.org/10.1007/bf01898401openalex-snapshot
Real time process algebra
inferredcites →https://doi.org/10.1007/bfb0039073openalex-snapshot
A temporal calculus of communicating systems
inferredcites →https://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferredcites →https://doi.org/10.1016/0304-3975(88)90030-8openalex-snapshot
A timed model for communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(93)90111-6openalex-snapshot
Transition system specifications with negative premises
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1017/cbo9780511624193openalex-snapshot
Process Algebra
inferredcites →https://doi.org/10.1093/comjnl/37.4.259openalex-snapshot
Basic Process Algebra with Iteration: Completeness of its Equational Axioms
inferredcites →https://doi.org/10.1145/27651.27653openalex-snapshot
Laws of programming
inferredcites →https://doi.org/10.1145/3318.3322openalex-snapshot
CIRCAL and the representation of communication, concurrency, and time
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.6100/ir408754openalex-snapshot
Models and axioms for a fragment of real time process algebra

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.2657openalex-snapshot
A Complete Axiomatization of Finite-state ACSR Processes
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_33openalex-snapshot
A congruence theorem for structured operational semantics with predicates
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_9openalex-snapshot
Timewise refinement for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_38openalex-snapshot
Discrete time process algebra with abstraction
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_5openalex-snapshot
Formal Semantics of Interworkings with Discrete Absolute Time
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_7openalex-snapshot
Real Time Process Algebra with Infinitesimals
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_32openalex-snapshot
A congruence theorem for structured operational semantics with predicates and negative premises
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_11openalex-snapshot
Timed Process Algebras: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/bf01212523openalex-snapshot
Formalizing process algebraic verifications in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/bf01214556openalex-snapshot
Discrete time process algebra
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00016-0openalex-snapshot
Timewise refinement for communicating processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)88197-2openalex-snapshot
Process algebra with language matching
inferred← citeshttps://doi.org/10.1109/aero.1997.577994openalex-snapshot
PARAGON: a paradigm for the specification, verification and testing of real-time systems
inferred← citeshttps://doi.org/10.1109/sefm.2010.41openalex-snapshot
Static Enforcement of Service Deadlines
inferred← citeshttps://doi.org/10.3233/fi-1996-26201openalex-snapshot
A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION
inferred← citeshttps://doi.org/10.3990/1.9789036524100openalex-snapshot
A run-time reconfigurable Network-on-Chip for streaming DSP applications
inferred← citeshttps://doi.org/10.7146/brics.v6i24.20093openalex-snapshot
Conservative Extension in Structural Operational Semantics
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.