On the public citation graph
TIC: A timed calculus
0 signed · 57 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/3-540-15648-8_14openalex-snapshot
Compositional semantics for real-time distributed computing
inferredcites →https://doi.org/10.1007/3-540-16761-7_81openalex-snapshot
A timed model for communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-18088-5_9openalex-snapshot
A timed failures model for extended communicating processes
inferredcites →https://doi.org/10.1007/3-540-19020-1_17openalex-snapshot
Metric spaces as models for real-time concurrency
inferredcites →https://doi.org/10.1007/3-540-52148-8_25openalex-snapshot
State exploration by transformation with lola
inferredcites →https://doi.org/10.1007/3-540-53982-4_23openalex-snapshot
A complete proof system for timed observations
inferredcites →https://doi.org/10.1007/bfb0039073openalex-snapshot
A temporal calculus of communicating systems
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(84)90067-7openalex-snapshot
Algèbre de processus et synchronisation
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/b978-0-444-89402-1.50027-8openalex-snapshot
LOTOS-like process algebras with urgent or timed interactions
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tcom.1976.1093424openalex-snapshot
Recoverability of Communication Protocols--Implications of a Theoretical Study
inferredcites →https://doi.org/10.1109/tse.1987.233170openalex-snapshot
Safety Analysis Using Petri Nets
inferredcites →https://doi.org/10.1145/3318.3322openalex-snapshot
CIRCAL and the representation of communication, concurrency, and time
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.448openalex-snapshot
A formal framework to test soft and hard deadlines in timed systems
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_52openalex-snapshot
On specifying real-time systems in a causality-based setting
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_25openalex-snapshot
Denotational semantics for timed testing
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_26openalex-snapshot
Extending LOTOS with time: A true concurrency perspective
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_5openalex-snapshot
The verus language: Representing time efficiently with BDDs
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_27openalex-snapshot
Testing Semantics for Probabilistic LOTOS
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4_2openalex-snapshot
Deterministically Timed Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-42626-1_2openalex-snapshot
Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time Additivity
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_16openalex-snapshot
Noninterference Analysis of Deterministically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_3openalex-snapshot
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
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/s001650050015openalex-snapshot
A Formal Definition of Time in LOTOS
inferred← citeshttps://doi.org/10.1007/s002360050107openalex-snapshot
Performance preorder and competitive equivalence
inferred← citeshttps://doi.org/10.1007/s10270-009-0126-3openalex-snapshot
Testing timed systems modeled by Stream X-machines
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90196-ropenalex-snapshot
A design methodology for the correct specification of VLSI systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-89874-6.50018-0openalex-snapshot
Development of Satellite Communication Networks based on LOTOS
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50028-xopenalex-snapshot
Process Algebra with Timing: Real Time and Discrete Time
inferred← citeshttps://doi.org/10.1016/j.scico.2005.10.011openalex-snapshot
On the expressiveness of timed coordination models
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.019openalex-snapshot
Process algebra for hybrid systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.022openalex-snapshot
Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114681openalex-snapshot
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115646openalex-snapshot
Causal reversibility in nondeterministic process calculi extended with time or probabilities
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00134-7openalex-snapshot
Partial order models for quantitative extensions of LOTOS
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00090-6openalex-snapshot
The Verus language: representing time efficiently with BDDs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00124-4openalex-snapshot
Bisimulation indexes and their applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00127-8openalex-snapshot
A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36336-xopenalex-snapshot
Expression of Temporal Constraints: A Syntactic Way
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43751-7openalex-snapshot
ATG: An Algebraic Specification, Temporal Logic and Graphical Representation for Real Time Systems
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00029-2openalex-snapshot
Revisiting timing in process algebra
inferred← citeshttps://doi.org/10.1017/cbo9781139195003openalex-snapshot
Process Algebra: Equational Theories of Communicating Processes
inferred← citeshttps://doi.org/10.1017/s0960129503004006openalex-snapshot
Embedding untimed into timed process algebra: the case for explicit termination
inferred← citeshttps://doi.org/10.1109/tc.2008.15openalex-snapshot
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
inferred← citeshttps://doi.org/10.3233/fi-1997-323407openalex-snapshot
An Axiomatization for Regular Processes in Timed Branching Bisimulation
inferred← citeshttps://doi.org/10.4204/eptcs.25.19openalex-snapshot
On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:11)2024openalex-snapshot
revTPL: The Reversible Temporal Process Language
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.