On the public citation graph
Algorithmic verification of linear temporal logic specifications
0 signed · 139 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-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-58179-0_72openalex-snapshot
Another look at LTL model checking
inferredcites →https://doi.org/10.1007/3-540-61422-2_117openalex-snapshot
Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
inferredcites →https://doi.org/10.1007/3-540-61474-5_68openalex-snapshot
A platform for combining deductive with algorithmic verification
inferredcites →https://doi.org/10.1007/3-540-63166-6_27openalex-snapshot
A new heuristic for bad cycle detection using BDDs
inferredcites →https://doi.org/10.1007/978-1-4471-3534-0openalex-snapshot
Specification and Verification of Concurrent Systems
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-540-69850-0_12openalex-snapshot
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferredcites →https://doi.org/10.1016/0890-5401(89)90004-7openalex-snapshot
The μ-calculus as an assertion-language for fairness arguments
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1023/a:1008615614281openalex-snapshot
Another Look at LTL Model Checking
inferredcites →https://doi.org/10.1023/a:1008727508722openalex-snapshot
A New Heuristic for Bad Cycle Detection Using BDDs
inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118602638.ch7openalex-snapshot
Verification of Finite‐State Systems
inferred← citeshttps://doi.org/10.1002/9781394203314.ch16openalex-snapshot
Exploiting Formal Modeling in Resilient System Design
inferred← citeshttps://doi.org/10.1002/cpe.3652openalex-snapshot
Distributed CTL model checking using MapReduce: theory and practice
inferred← citeshttps://doi.org/10.1006/inco.2000.3000openalex-snapshot
Verification by Augmented Finitary Abstraction
inferred← citeshttps://doi.org/10.1006/jcss.2000.1744openalex-snapshot
Verification by Augmented Abstraction: The Automata–Theoretic View
inferred← citeshttps://doi.org/10.1007/0-387-34600-7openalex-snapshot
Abstraction Refinement for Large Scale Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_21openalex-snapshot
Efficient Büchi Automata from LTL Formulae
inferred← citeshttps://doi.org/10.1007/11513988_10openalex-snapshot
Incremental and Complete Bounded Model Checking for Full PLTL
inferred← citeshttps://doi.org/10.1007/11539452_40openalex-snapshot
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/11609773_18openalex-snapshot
Ranking Abstraction of Recursive Programs
inferred← citeshttps://doi.org/10.1007/11813040_38openalex-snapshot
PSL Model Checking and Run-Time Verification Via Testers
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_6openalex-snapshot
Analysis of Symbolic SCC Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_7openalex-snapshot
Sharp Disjunctive Decomposition for Language Emptiness Checking
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_6openalex-snapshot
Parameterized Verification by Probabilistic Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_10openalex-snapshot
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_4openalex-snapshot
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
inferred← citeshttps://doi.org/10.1007/3-540-44829-2_4openalex-snapshot
Distributed Explicit Fair Cycle Detection (Set Based Approach)
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_29openalex-snapshot
Is There a Best Symbolic Cycle-Detection Algorithm?
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_3openalex-snapshot
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_2openalex-snapshot
A Deductive Proof System for CTL*
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_15openalex-snapshot
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_19openalex-snapshot
A Simulation Preorder for Abstraction of Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_12openalex-snapshot
A Perfecto Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_11openalex-snapshot
Verifying Liveness by Augmented Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-030-12835-7_9openalex-snapshot
Fairness in Distributed Systems Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_7openalex-snapshot
GR(1)*: GR(1) Specifications Extended with Existential Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-030-32079-9_10openalex-snapshot
Assumption-Based Runtime Verification with Partial Observability and Resets
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_6openalex-snapshot
Proving the Existence of Fair Paths in Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-88885-5_3openalex-snapshot
Automatic Discovery of Fair Paths in Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-65941-6_8openalex-snapshot
Specifying Fairness Constraints and Model Checking with Non-intensional Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-74186-9_19openalex-snapshot
Common Sense Plan Verification with Large Language Models
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_17openalex-snapshot
Another Look at LTL Modulo Theory over Finite and Infinite Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_1openalex-snapshot
Configuration Monitor Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_24openalex-snapshot
MightyPPL: Model Checking MITL with Past and Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-3-032-30693-7_28openalex-snapshot
Symbolic Model Checking for Linear Temporal Dynamic Logic via Compositional Testers
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_17openalex-snapshot
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_3openalex-snapshot
Algorithms for Model Checking HyperLTL and HyperCTL $$^*$$
inferred← citeshttps://doi.org/10.1007/978-3-319-47846-3_23openalex-snapshot
Scaling BDD-based Timed Verification with Simulation Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_43openalex-snapshot
From Complementation to Certification
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_3openalex-snapshot
A Survey of Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_32openalex-snapshot
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_9openalex-snapshot
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_14openalex-snapshot
Reasoning About Systems with Transition Fairness
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_36openalex-snapshot
Bridging the Gap between Fair Simulation and Trace Inclusion
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_11openalex-snapshot
On the Merits of Temporal Testers
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_24openalex-snapshot
From LTL to Symbolically Represented Deterministic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_24openalex-snapshot
Self-Loop Aggregation Product — A New Hybrid Approach to On-the-Fly LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_37openalex-snapshot
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_28openalex-snapshot
Symbolic Model-Checking of Stateful Timed CSP Using BDD and Digitization
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_42openalex-snapshot
Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_8openalex-snapshot
Compositional Branching-Time Measurements
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_38openalex-snapshot
Symbolic Model Checking of Stutter-Invariant Properties Using Generalized Testing Automata
inferred← citeshttps://doi.org/10.1007/bfb0055757openalex-snapshot
Modularization and abstraction: The keys to practical formal verification
inferred← citeshttps://doi.org/10.1007/s00165-021-00535-6openalex-snapshot
GR(1)*: GR(1) specifications extended withexistential guarantees
inferred← citeshttps://doi.org/10.1007/s00236-015-0222-5openalex-snapshot
Parametrized invariance for infinite state processes
inferred← citeshttps://doi.org/10.1007/s00236-015-0242-1openalex-snapshot
Extracting unsatisfiable cores for LTL via temporal resolution
inferred← citeshttps://doi.org/10.1007/s007660200019openalex-snapshot
Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts
inferred← citeshttps://doi.org/10.1007/s10009-003-0107-8openalex-snapshot
Generating online test oracles from temporal logic specifications
inferred← citeshttps://doi.org/10.1007/s10009-016-0422-5openalex-snapshot
Variations on parallel explicit emptiness checks for generalized Büchi automata
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state systems
inferred← citeshttps://doi.org/10.1007/s10703-006-4341-zopenalex-snapshot
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
inferred← citeshttps://doi.org/10.1007/s10703-006-4342-yopenalex-snapshot
Model Checking with Strong Fairness
inferred← citeshttps://doi.org/10.1007/s10703-006-4617-3openalex-snapshot
Compositional SCC Analysis for Language Emptiness
inferred← citeshttps://doi.org/10.1007/s10703-023-00416-zopenalex-snapshot
Assumption-based Runtime Verification
inferred← citeshttps://doi.org/10.1007/s11334-011-0146-3openalex-snapshot
Symbolic computation of strongly connected components and fair cycles using saturation
inferred← citeshttps://doi.org/10.1016/j.cose.2013.10.002openalex-snapshot
Model checking authorization requirements in business processes
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.06.002openalex-snapshot
Linear Temporal Logic Symbolic Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2005.01.006openalex-snapshot
Bridging the gap between fair simulation and trace inclusion
inferred← citeshttps://doi.org/10.1016/j.ic.2009.02.001openalex-snapshot
Partitioned PLTL model-checking for refined transition systems
inferred← citeshttps://doi.org/10.1016/j.ic.2009.12.003openalex-snapshot
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.08.466openalex-snapshot
Data-Driven Safety Verification of Stochastic Systems via Barrier Certificates
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.08.007openalex-snapshot
Synthesis of Reactive(1) designs
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.023openalex-snapshot
A compositional approach to CTL* verification
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.021openalex-snapshot
From complementation to certification
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.011openalex-snapshot
Embedding finite automata within regular expressions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113702openalex-snapshot
A proof system for unified temporal logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80095-7openalex-snapshot
Distributed Explicit Bounded LTL Model Checking
inferred← citeshttps://doi.org/10.1049/iet-cdt.2010.0154openalex-snapshot
Efficient model checking of PSL safety properties
inferred← citeshttps://doi.org/10.1093/jigpal/jzn018openalex-snapshot
A Sound and Complete Deductive System for CTL* Verification
inferred← citeshttps://doi.org/10.1093/logcom/exad012openalex-snapshot
Incrementally predictive runtime verification
inferred← citeshttps://doi.org/10.1109/acsd.2010.27openalex-snapshot
Efficient Model Checking of PSL Safety Properties
inferred← citeshttps://doi.org/10.1109/apsec.2012.15openalex-snapshot
Proving Liveness Property under Fairness Requirements
inferred← citeshttps://doi.org/10.1109/apsec.2013.79openalex-snapshot
Multi-core Model Checking Algorithms for LTL Verification with Fairness Assumptions
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619014openalex-snapshot
Verifying rLTL formulas: now faster than ever before!
inferred← citeshttps://doi.org/10.1109/csd.2004.1309129openalex-snapshot
Nested emptiness search for generalized Buchi automata
inferred← citeshttps://doi.org/10.1109/dasc62030.2024.10749382openalex-snapshot
Flight Incident Analysis Through Symbolic Argumentation
inferred← citeshttps://doi.org/10.1109/fmcad.2013.6679391openalex-snapshot
A circuit approach to LTL model checking
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987590openalex-snapshot
Response property checking via distributed state space exploration
inferred← citeshttps://doi.org/10.1109/iceee.2007.4345001openalex-snapshot
An improvement on the Symbolic L* Algorithm
inferred← citeshttps://doi.org/10.1109/icnc.2014.6975996openalex-snapshot
A theoretic approach to translation of linear temporal logic into an automaton
inferred← citeshttps://doi.org/10.1109/iecon.2002.1185233openalex-snapshot
A modal logic-based model of traffic system
inferred← citeshttps://doi.org/10.1109/is.2006.348461openalex-snapshot
Specification and Verification of Reconfiguration Protocols in Grid Component Systems
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00028openalex-snapshot
SOG-Based Multi-Core LTL Model Checking
inferred← citeshttps://doi.org/10.1109/jproc.2018.2834926openalex-snapshot
Layering Assume-Guarantee Contracts for Hierarchical System Design
inferred← citeshttps://doi.org/10.1109/memcod.2004.1459809openalex-snapshot
Bounded model checking of infinite state systems: exploiting the automata hierarchy
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487911openalex-snapshot
Refinemant verification of fair transition systems can contribute to PLTL model checking
inferred← citeshttps://doi.org/10.1109/seaa53835.2021.00055openalex-snapshot
ICARUS - Incremental Design and Verification of Software Updates in Safety-Critical Product Lines
inferred← citeshttps://doi.org/10.1109/sice.2002.1195345openalex-snapshot
A formalization of real-time system using modal logic
inferred← citeshttps://doi.org/10.1109/time.2013.15openalex-snapshot
Extracting Unsatisfiable Cores for LTL via Temporal Resolution
inferred← citeshttps://doi.org/10.1109/tse.2004.33openalex-snapshot
Tool support for verifying UML activity diagrams
inferred← citeshttps://doi.org/10.1145/1067915.1067918openalex-snapshot
PLTL-partitioned model checking for reactive systems under fairness assumptions
inferred← citeshttps://doi.org/10.1145/1125808.1125809openalex-snapshot
Symbolic model checking of UML activity diagrams
inferred← citeshttps://doi.org/10.1145/1190215.1190257openalex-snapshot
Proving that programs eventually do something good
inferred← citeshttps://doi.org/10.1145/1827418.1827465openalex-snapshot
Analyzing the behavior of event processing applications
inferred← citeshttps://doi.org/10.1145/3286976openalex-snapshot
From Real-time Logic to Timed Automata
inferred← citeshttps://doi.org/10.1145/3491216openalex-snapshot
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic
inferred← citeshttps://doi.org/10.1145/581339.581362openalex-snapshot
Verification support for workflow design with UML activity graphs
inferred← citeshttps://doi.org/10.2168/lmcs-9(2:12)2013openalex-snapshot
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
inferred← citeshttps://doi.org/10.22028/d291-25890openalex-snapshot
Temporal verification with transition invariants
inferred← citeshttps://doi.org/10.3390/a7030339openalex-snapshot
Model Checking Properties on Reduced Trace Systems
inferred← citeshttps://doi.org/10.3390/en17133059openalex-snapshot
Machine Learning and Optimization in Energy Management Systems for Plug-In Hybrid Electric Vehicles: A Comprehensive Review
inferred← citeshttps://doi.org/10.3929/ethz-a-005170555openalex-snapshot
Liveness checking as safety checking to find shortest counterexamples to linear time properties
inferred← citeshttps://doi.org/10.4204/eptcs.202.6openalex-snapshot
A multi-paradigm language for reactive synthesis
inferred← citeshttps://doi.org/10.5555/2682923.2682934openalex-snapshot
Response property checking via distributed state space exploration
inferred← citeshttps://doi.org/10.70675/e2f846eezbcafz4543za309z6a60439b9888openalex-snapshot
Abstraction and modular verification of inter-enterprise business processes
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.