On the public citation graph

Model checking for action-based logics

https://doi.org/10.1007/bf01384084
0 signed · 36 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/3-540-52148-8_15openalex-snapshot
Implementing a model checking algorithm by adapting existing automated tools
inferredcites →https://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
inferredcites →https://doi.org/10.1007/3-540-53479-2_17openalex-snapshot
Action versus state based logics for transition systems
inferredcites →https://doi.org/10.1007/3-540-53932-8_41openalex-snapshot
An introduction to modal and temporal logics for CCS
inferredcites →https://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferredcites →https://doi.org/10.1007/bfb0013022openalex-snapshot
Branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferredcites →https://doi.org/10.1007/bfb0013027openalex-snapshot
A logic for the description of behaviours and properties of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0169-7552(93)90047-8openalex-snapshot
An action-based framework for veryfying logical and behavioural properties of concurrent 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(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1142/9789814343039_0004openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1145/201019.201032openalex-snapshot
Three logics for branching bisimulation
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
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/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using 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.1007/3-540-40911-4_24openalex-snapshot
Towards Model Checking Stochastic Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_13openalex-snapshot
From the Archives of the Formal Methods and Tools Lab
inferred← citeshttps://doi.org/10.1007/978-3-030-30985-5_1openalex-snapshot
The Legacy of Stefania Gnesi
inferred← citeshttps://doi.org/10.1007/978-3-030-30985-5_24openalex-snapshot
Hunting Superfluous Locks with Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_6openalex-snapshot
Action-Based Model Checking: Logic, Automata, and Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_6openalex-snapshot
Quantitative Analysis of Communication Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-642-13568-2_10openalex-snapshot
A Formal Language toward the Unification of Model Checking and Performance Evaluation
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1016/j.fss.2014.07.008openalex-snapshot
Model checking fuzzy computation tree logic
inferred← citeshttps://doi.org/10.1016/j.ins.2007.10.023openalex-snapshot
ACTLW – An action-based computation tree logic with unless operator
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00012-1openalex-snapshot
Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking
inferred← citeshttps://doi.org/10.1109/formalise.2015.12openalex-snapshot
Infer Gene Regulatory Networks from Time Series Data with Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1109/tse.2007.36openalex-snapshot
Model Checking Markov Chains with Actions and State Labels
inferred← citeshttps://doi.org/10.3166/tsi.22.461-495openalex-snapshot
Logiques temporelles basées sur actions pour la vérification des systèmes asynchrones
inferred← citeshttps://doi.org/10.3990/1.9783952285008openalex-snapshot
Extensions of Statecharts with probability, time, and stochastic timing
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.