On relative and probabilistic finite counterability

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Annual Conference for Computer Science Logic

• Publication date

  2018-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.CSL.2015.175
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Spanning the spectrum from safety to liveness

  2015cited by this paper
• A Note on Monitors and Büchi Automata

  2015cited by this paper
• Probably safe or live

  2014cited by this paper
• Temporalised description logics for monitoring partially observable events

  2014cited by this paper
• Deciding safety and liveness in TPTL

  2014cited by this paper
• Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey

  2014cited by this paper
• A Framework for Ranking Vacuity Results

  2013cited by this paper
• Synthesis of Trigger Properties

  2010cited by this paper
• From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

  2006cited by this paper
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words

  2006cited by this paper
• Liveness Checking as Safety Checking for Infinite State Spaces

  2006cited by this paper
• On the Construction of Fine Automata for Safety Properties

  2006cited by this paper
• Shortest Counterexamples for Symbolic Model Checking of LTL with Past

  2005cited by this paper
• Recognizing safety and liveness

  2005cited by this paper
• From complementation to certification

  2005cited by this paper
• An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems

  2003cited by this paper
• Bounded Model Checking Using Satisfiability Solving

  2001cited by this paper
• Counterexample-Guided Abstraction Refinement

  2000cited by this paper
• Model Checking of Safety Properties

  1999cited by this paper
• From Pre-Historic to Post-Modern Symbolic Model Checking

  1998cited by this paper
• Relative liveness and behavior abstraction (extended abstract)

  1997cited by this paper
• The complexity of probabilistic verification

  1995cited by this paper
• Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking

  1995cited by this paper
• Reasoning About Infinite Computations

  1994cited by this paper
• Safety, liveness and fairness in temporal logic

  1994cited by this paper
• Sooner is Safer Than Later

  1992cited by this paper
• The complexity of propositional linear temporal logics

  1985cited by this paper
• Automatic verification of probabilistic concurrent finite state programs

  1985cited by this paper
• Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs

  1984cited by this paper
• Defining Liveness

  1984cited by this paper
• Proving Liveness Properties of Concurrent Programs

  1982cited by this paper
• On the temporal analysis of fairness

  1980cited by this paper
• The Temporal Semantics of Concurrent Programs

  1979cited by this paper
• The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space

  1972cited by this paper
• Denumerable Markov chains

  1969cited by this paper
• On a decision method in restricted second-order arithmetic

  1960cited by this paper

• Safety and Liveness on Finite Words

  2025cites this paper
• Fuzzy Safety and Liveness Properties in Linear-time

  2024cites this paper
• Monitorability for Runtime Verification

  2023cites this paper
• Runtime Verification: From Propositional to First-Order Temporal Logic

  2018cites this paper
• Refining the Safety-Liveness Classification of Temporal Properties According to Monitorability

  2018influential citation
• A Note on Monitors and Büchi Automata

  2015cites this paper
• Automated Technology for Verification and Analysis

  2015influential citation
• Spanning the spectrum from safety to liveness

  2015cites this paper