On the public citation graph

Temporal logics for CCS

https://doi.org/10.1007/bfb0013039
0 signed · 52 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/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_4openalex-snapshot
Correspondence Theory
inferredcites →https://doi.org/10.1007/bf00289140openalex-snapshot
Axiomatising finite delay operators
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1016/s0019-9958(85)80025-5openalex-snapshot
The power of the future perfect in program logics
inferredcites →https://doi.org/10.1109/lics.1988.5117openalex-snapshot
Bisimulations and divergence
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/scj.4690250101openalex-snapshot
PQL: Modal logic for compositional verification of concurrent programs
inferred← citeshttps://doi.org/10.1007/0-306-47003-9_13openalex-snapshot
Implementing a Modal Logic Over Data and Processes Using XTL
inferred← citeshttps://doi.org/10.1007/11526988_4openalex-snapshot
Evolution and Reactivity for the Web
inferred← citeshttps://doi.org/10.1007/11691792_14openalex-snapshot
A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_21openalex-snapshot
An Adequate Logic for Full LOTOS
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_17openalex-snapshot
Action versus state based logics for transition systems
inferred← citeshttps://doi.org/10.1007/3-540-53932-8_41openalex-snapshot
An introduction to modal and temporal logics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_5openalex-snapshot
An action based framework for verifying logical and behavioural properties of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_104openalex-snapshot
Decidability of a partial order based temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_4openalex-snapshot
A practical technique for process abstraction
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_84openalex-snapshot
Free shuffle algebras in language varieties extended abstract
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_6openalex-snapshot
The Formalization and Analysis of CCR Protocol and Service
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_32openalex-snapshot
Selective mu-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-2061-2_3openalex-snapshot
Validating Safety Models with Fault Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-69096-4_116openalex-snapshot
The Application of Decision Tree in Workflow
inferred← citeshttps://doi.org/10.1007/bf01212487openalex-snapshot
A CCS-based investigation of deadlock in a multi-process electronic mail system
inferred← citeshttps://doi.org/10.1007/bf01887209openalex-snapshot
Automated analysis of mutual exclusion algorithms using CCS
inferred← citeshttps://doi.org/10.1007/bfb0039055openalex-snapshot
Verifying temporal properties of processes
inferred← citeshttps://doi.org/10.1007/s00236-012-0161-3openalex-snapshot
Abstract reduction in directed model checking CCS processes
inferred← citeshttps://doi.org/10.1007/s10703-005-1634-6openalex-snapshot
Reduced Models for Efficient CCS Verification
inferred← citeshttps://doi.org/10.1016/0141-9331(94)90109-0openalex-snapshot
A case study in specifying and testing architectural features
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90047-8openalex-snapshot
An action-based framework for veryfying logical and behavioural properties of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90183-gopenalex-snapshot
Local model checking for infinite state spaces
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.11.001openalex-snapshot
A local approach for temporal model checking of Java bytecode
inferred← citeshttps://doi.org/10.1016/s0141-9331(01)00123-5openalex-snapshot
Reusing LOTOS specifications
inferred← citeshttps://doi.org/10.1016/s0141-9331(01)00131-4openalex-snapshot
A tool supporting efficient model checking of concurrent specifications
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)51359-2openalex-snapshot
The Formalization and Analysis of a Communications Protocol
inferred← citeshttps://doi.org/10.1109/compsac.2011.22openalex-snapshot
Ant Colony Optimization for Deadlock Detection in Concurrent Systems
inferred← citeshttps://doi.org/10.1109/hicss.1993.284112openalex-snapshot
Model checking of control-finite CSP programs
inferred← citeshttps://doi.org/10.1145/201019.201032openalex-snapshot
Three logics for branching bisimulation
inferred← citeshttps://doi.org/10.3390/app10227975openalex-snapshot
Call Graph and Model Checking for Fine-Grained Android Malicious Behaviour Detection
inferred← citeshttps://doi.org/10.3390/app10238351openalex-snapshot
Detecting Colluding Inter-App Communication in Mobile Environment
inferred← citeshttps://doi.org/10.5282/ubm/epub.14881openalex-snapshot
State-of-the-art on evolution and reactivity
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.