On the public citation graph
Verifying temporal properties of processes
0 signed · 72 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-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/978-1-4471-3860-0_1openalex-snapshot
A General Tableau Technique for Verifying Temporal Properties of Concurrent Programs
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bf01887209openalex-snapshot
Automated analysis of mutual exclusion algorithms using CCS
inferredcites →https://doi.org/10.1007/bfb0019967openalex-snapshot
Proving temporal properties of Petri nets
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1007/bfb0035797openalex-snapshot
A note on model checking the modal v-calculus
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(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/0304-3975(91)90043-2openalex-snapshot
A note on model checking the modal ν-calculus
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/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system 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-36578-8_17openalex-snapshot
A Temporal Approach to Specification and Verification of Pointer Data-Structures
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_11openalex-snapshot
General Distributions in Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_18openalex-snapshot
Extending the Petri Box Calculus with Time
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_18openalex-snapshot
Demand-Driven Model Checking for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_18openalex-snapshot
Formula Based Abstractions of Transition Systems for Real-Time Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_19openalex-snapshot
Consistency of Partial Process Specifications
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_135openalex-snapshot
The expressive power of implicit specifications
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-55251-0_8openalex-snapshot
CTL* and ECTL* as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_3openalex-snapshot
Place bisimulations in Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_25openalex-snapshot
A proof assistant for symbolic model-checking
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_105openalex-snapshot
Local model checking for context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_2openalex-snapshot
On model checking infinite-state systems
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_52openalex-snapshot
Model checking of macro processes
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_42openalex-snapshot
An integration of model checking with automated proof checking
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_1openalex-snapshot
Local model checking games (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60385-9_1openalex-snapshot
What if model checking must be truly symbolic
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_4openalex-snapshot
Modal μ-calculus, model checking and Gauß elimination
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_8openalex-snapshot
Specifying properties of Basic LOTOS processes using temporal logic
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_2openalex-snapshot
Modal Logics in Timed Process Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_4openalex-snapshot
A Process Calculus with Incomparable Priorities
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_4openalex-snapshot
Conditional Narrowing Modulo in Rewriting Logic and Maude
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_15openalex-snapshot
Behavioural Models for FMI Co-simulations
inferred← citeshttps://doi.org/10.1007/978-3-540-40022-6_9openalex-snapshot
Rule-Based Refinement of Petri Nets: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_10openalex-snapshot
Local Model Checking for Parallel Compositions of Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-7908-1840-6_8openalex-snapshot
Rough Set Methods for the Synthesis and Analysis of Concurrent Processes
inferred← citeshttps://doi.org/10.1007/bf00121261openalex-snapshot
Automatic verification of distributed systems: The process algebra approach
inferred← citeshttps://doi.org/10.1007/bfb0053593openalex-snapshot
Rule-based refinement of high-level nets preserving safety properties
inferred← citeshttps://doi.org/10.1007/s10626-011-0102-2openalex-snapshot
On the composition of time Petri nets
inferred← citeshttps://doi.org/10.1007/s10703-005-1634-6openalex-snapshot
Reduced Models for Efficient CCS Verification
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(92)90183-gopenalex-snapshot
Local model checking for infinite state spaces
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(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00119-0openalex-snapshot
Trapping mutual exclusion in the box calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00166-2openalex-snapshot
On the operational semantics of nondeterminism and divergence
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50024-3openalex-snapshot
Formalizing a Modal Logic for CCS in the HOL Theorem Prover
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.042openalex-snapshot
Trace Machines for Observing Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.05.031openalex-snapshot
Formal Verification of Concurrent Systems via Directed Model Checking
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.003openalex-snapshot
DELFIN+: An efficient deadlock detection tool for CCS processes
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00022-8openalex-snapshot
Rule-based refinement of high-level nets preserving safety properties
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)37205-1openalex-snapshot
Rule-Based Refinement of Petri Nets for Modeling Train Control Systems
inferred← citeshttps://doi.org/10.1023/a:1026534200187openalex-snapshot
Logic Based Abstractions of Real-Time Systems
inferred← citeshttps://doi.org/10.1061/41114(371)372openalex-snapshot
Transitioning of Urban Water Distribution Systems
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/lics.1991.151661openalex-snapshot
Actions speak louder than words: proving bisimilarity for context-free processes
inferred← citeshttps://doi.org/10.1145/3622786openalex-snapshot
Extensible Proof Systems for Infinite-State Systems
inferred← citeshttps://doi.org/10.14236/ewic/fa1996.5openalex-snapshot
Formal Analysis of Concurrent Real-Time Requirements Models
inferred← citeshttps://doi.org/10.3233/jid-2002-6307openalex-snapshot
PETRI NET BASED COMPONENTS FOR EVOLVABLE ARCHITECTURES
inferred← citeshttps://doi.org/10.3233/jid-2004-8405openalex-snapshot
SAFETY PROPERTIES IN PETRI NET MODULES
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
inferred← citeshttps://doi.org/10.7146/dpb.v22i446.6763openalex-snapshot
On Reasoning about Infinite-State Systems in the Modal µ-Calculus
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.