On the public citation graph

Proof systems for Hennessy-Milner Logic with recursion

https://doi.org/10.1007/bfb0026106
0 signed · 141 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-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-13345-3_20openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferredcites →https://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferredcites →https://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferredcites →https://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferredcites →https://doi.org/10.1007/bf00288467openalex-snapshot
A logic for the specification and proof of regular controllable processes of CCS
inferredcites →https://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0036900openalex-snapshot
Behavioural equivalence relations induced by programming logics
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(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(85)90004-0openalex-snapshot
A logical characterization of observation equivalence
inferredcites →https://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/j.jlap.2004.05.001openalex-snapshot
A structural approach to operational semantics
inferredcites →https://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.7146/dpb.v11i146.7420openalex-snapshot
Results on the Propositional µ-Calculus

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.1994.1034openalex-snapshot
An Analysis of Ramsey′s Theorem
inferred← citeshttps://doi.org/10.1006/inco.1996.0072openalex-snapshot
Model Checking Mobile Processes
inferred← citeshttps://doi.org/10.1007/11691617_8openalex-snapshot
Distributed On-the-Fly Model Checking and Test Case Generation
inferred← citeshttps://doi.org/10.1007/11823230_9openalex-snapshot
Underapproximating Predicate Transformers
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-51237-3_14openalex-snapshot
The use of static constructs in a model process logic
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_19openalex-snapshot
Comparing linear and branching time temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_14openalex-snapshot
CCS, liveness, and local model checking in the linear time mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_15openalex-snapshot
Implementing a model checking algorithm by adapting existing automated tools
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_19openalex-snapshot
Modal specifications
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_76openalex-snapshot
Compositional theories based on an operational semantics of contexts
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-54233-7_129openalex-snapshot
Computing behavioural relations, logically
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_135openalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_73openalex-snapshot
A model for real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_54openalex-snapshot
Data flow analysis as model checking
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_31openalex-snapshot
Formal specification of fault tolerant real time systems using minimal 3-sorted modal logic
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_23openalex-snapshot
An automated proof technique for finite-state machine equivalence
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
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-55179-4_6openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_1openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_8openalex-snapshot
Analyzing concurrent systems using the Concurrency Workbench
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_30openalex-snapshot
A modal logic for message passing processes
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_3openalex-snapshot
Model checking mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_31openalex-snapshot
A linear local model checking algorithm for CTL
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_49openalex-snapshot
Efficient fixpoint computation
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_62openalex-snapshot
Petri nets, traces, and local model checking
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_61openalex-snapshot
HORNSAT, model checking, verification and games
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_81openalex-snapshot
Action refinement and property inheritance in systems of sequential agents
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_46openalex-snapshot
Dynamic scheduling in the presence of faults: Specification and verification
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_45openalex-snapshot
Towards the one-tiered design of data types and transition systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_14openalex-snapshot
Specifying Processes in Terms of Their Environments
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_15openalex-snapshot
Hennessy-Milner Logic with recursion as a specification language, and a refinement calculus based on it
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_16openalex-snapshot
A Functional Programming Approach to the Specification and Verification of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-30923-7_1openalex-snapshot
Model Verification Through Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_13openalex-snapshot
Compositional Verification of Concurrent Systems by Combining Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_13openalex-snapshot
On-the-Fly Model Checking for Extended Action-Based Probabilistic Operators
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_9openalex-snapshot
Pushdown Processes: Parallel Composition and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_12openalex-snapshot
A Model Checking Language for Concurrent Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_6openalex-snapshot
Computation Tree Regular Logic for Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_38openalex-snapshot
Incremental, Inductive CTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_13openalex-snapshot
Computer Aided Verification of Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-94-011-1793-7_12openalex-snapshot
The Place of Strictly Defined Notation in Human Insight
inferred← citeshttps://doi.org/10.1007/bf00121261openalex-snapshot
Automatic verification of distributed systems: The process algebra approach
inferred← citeshttps://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferred← citeshttps://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/bf01178384openalex-snapshot
A modal logic for message passing processes
inferred← citeshttps://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/bf01887208openalex-snapshot
A refinement calculus for specifications in Hennessy-Milner logic with recursion
inferred← citeshttps://doi.org/10.1007/bf01887209openalex-snapshot
Automated analysis of mutual exclusion algorithms using CCS
inferred← citeshttps://doi.org/10.1007/bfb0013039openalex-snapshot
Temporal logics for CCS
inferred← citeshttps://doi.org/10.1007/bfb0013987openalex-snapshot
Efficient computation of nested fix-points, with applications to model checking
inferred← citeshttps://doi.org/10.1007/bfb0024649openalex-snapshot
Applications of modal logic for the specification of real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0029625openalex-snapshot
Specification & verification of higher order processes
inferred← citeshttps://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/bfb0035797openalex-snapshot
A note on model checking the modal v-calculus
inferred← citeshttps://doi.org/10.1007/bfb0039055openalex-snapshot
Verifying temporal properties of processes
inferred← citeshttps://doi.org/10.1007/bfb0055040openalex-snapshot
Simple linear-time algorithms for minimal fixed points
inferred← citeshttps://doi.org/10.1007/bfb0084787openalex-snapshot
Model checking for context-free processes
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s002360050020openalex-snapshot
A modal logic for message passing processes
inferred← citeshttps://doi.org/10.1007/s10009-018-0499-0openalex-snapshot
On-the-fly model checking for extended action-based probabilistic operators
inferred← citeshttps://doi.org/10.1007/s10009-020-00578-9openalex-snapshot
Dependency graphs with applications to verification
inferred← citeshttps://doi.org/10.1007/s100090050031openalex-snapshot
Local model checking and protocol analysis
inferred← citeshttps://doi.org/10.1007/s10207-014-0252-yopenalex-snapshot
Formal modeling and automatic enforcement of Bring Your Own Device policies
inferred← citeshttps://doi.org/10.1007/s10703-021-00360-wopenalex-snapshot
Compositional verification of concurrent systems by combining bisimulations
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/0167-6423(93)90003-8openalex-snapshot
Generating data flow analysis algorithms from modal specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
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(91)90043-2openalex-snapshot
A note on model checking the modal ν-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90155-mopenalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90342-qopenalex-snapshot
A complete modal proof system for HAL: the Herbrand agent language
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1016/0950-5849(94)90095-7openalex-snapshot
Formal methods and design extraction: a pilot study
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.009openalex-snapshot
CTRL: Extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.007openalex-snapshot
Complete proof systems for weighted modal logic
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00094-1openalex-snapshot
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00171-7openalex-snapshot
Swinging types=functions+relations+transition systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00326-xopenalex-snapshot
Petri nets, traces, and local model checking
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00233-8openalex-snapshot
Duality for modal μ-logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00245-4openalex-snapshot
A compositional μ-calculus proof system for statecharts processes
inferred← citeshttps://doi.org/10.1109/hol.1991.596301openalex-snapshot
Recursive Boolean Functions In HOL
inferred← citeshttps://doi.org/10.1109/icci.1992.227708openalex-snapshot
Linear local and global model checking algorithms for a kernal temporal logic language
inferred← citeshttps://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferred← citeshttps://doi.org/10.1109/lics.1990.113768openalex-snapshot
When is 'partial' adequate? A logic-based proof technique using partial specifications
inferred← citeshttps://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.1109/time.2013.9openalex-snapshot
Incremental, Inductive Model Checking
inferred← citeshttps://doi.org/10.1145/127056.127092openalex-snapshot
Towards a type theory for active objects
inferred← citeshttps://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.1145/165854.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.1145/2429069.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferred← citeshttps://doi.org/10.1145/2480359.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferred← citeshttps://doi.org/10.1145/268946.268950openalex-snapshot
Data flow analysis is model checking of abstract interpretations
inferred← citeshttps://doi.org/10.1145/3622786openalex-snapshot
Extensible Proof Systems for Infinite-State Systems
inferred← citeshttps://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)
inferred← citeshttps://doi.org/10.1184/r1/6468005openalex-snapshot
Privacy Policy Specification and Audit in a Fixed-Point Logic - How to enforce HIPAA, GLBA and all that (CMU-CyLab-10-008)
inferred← citeshttps://doi.org/10.1201/9781420006674.ch15openalex-snapshot
Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.21236/ada571959openalex-snapshot
Privacy Policy Specification and Audit in a Fixed-Point Logic - How to Enforce HIPAA, GLBA and All That
inferred← citeshttps://doi.org/10.23638/lmcs-17(1:6)2021openalex-snapshot
Modal Logics for Nominal Transition Systems
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.4230/lipics.concur.2015.198openalex-snapshot
Modal Logics for Nominal Transition Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1904.02564openalex-snapshot
Modal Logics for Nominal Transition Systems
inferred← citeshttps://doi.org/10.54337/aau510736584openalex-snapshot
Abstract Dependency Graphs for Model Verification
inferred← citeshttps://doi.org/10.70675/d577d68cz444bz40a4z951fza32dbfafa076openalex-snapshot
Towards an integrative approach for the modeling and formal verification of biological regulatory networks
inferred← citeshttps://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v2i18.19920openalex-snapshot
Complexity Results for Model Checking
inferred← citeshttps://doi.org/10.7146/brics.v2i39.19941openalex-snapshot
Petri Nets, Traces, and Local Model Checking
inferred← citeshttps://doi.org/10.7146/brics.v3i39.20021openalex-snapshot
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
inferred← citeshttps://doi.org/10.7146/brics.v5i40.19485openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/dpb.v20i352.6582openalex-snapshot
A Model for Real-Time Systems
inferred← citeshttps://doi.org/10.7146/dpb.v21i420.7971openalex-snapshot
Local Computation of Simultaneous Fixed-Points
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
inferred← citeshttps://doi.org/10.7146/dpb.v26i519.7048openalex-snapshot
Model Checking Coloured Petri Nets - Exploiting Strongly Connected Components
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.