Defining liveness
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Behaviour approximated on subgroups
- From liveness to promptness
- Recognizing safety and liveness
- Concurrent systems and inevitability
- Correctness of concurrent processes
- Operational specification with joint actions: Serializable databases
- Sooner is safer than later
- Verification of distributed programs using representative interleaving sequences
- The meaning of frozen tokens in live nets
- Liveness in timed and untimed systems
- A fully abstract trace model for dataflow and asynchronous networks
- Safety, liveness and fairness in temporal logic
- Quiescence, fairness, testing, and the notion of implementation
- A methodology for designing proof rules for fair parallel programs
- Inference of -languages from prefixes.
- Spanning the spectrum from safety to liveness
- Shield synthesis
- Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of -automata
- Automation of fault-tolerant graceful degradation
- On relative and probabilistic finite counterability
- Succinct representations of languages by DFA with different levels of reliability
- Time and logic: A calculus of binary events
- On control of systems modelled as deterministic Rabin automata
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
- Symbolic synthesis of masking fault-tolerant distributed programs
- Relating computer systems to sequence diagrams: the impact of underspecification and inherent nondeterminism
- On the limits of refinement-testing for model-checking CSP
- On hierarchically developing reactive systems
- MinMax algorithms for stabilizing consensus
- A system for deduction-based formal verification of workflow-oriented software models
- On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary Petri net
- Verification of compliance for multilevel models in individual trace semantics
- A semantic model for interacting cyber-physical systems
- Model checking hyperproperties for Markov decision processes
- Finite-word hyperlanguages
- Synthesizing robust systems
- Model checking of linear-time properties in multi-valued systems
- The complexity of automated addition of fault-tolerance without explicit legitimate states
- On probabilistic snap-stabilization
- Non-interference and local correctness in transactional memory
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models
- LTL is closed under topological closure
- A complete characterization of deterministic regular liveness properties
- Programming interfaces and basic topology
- Deadness and how to disprove liveness in hybrid dynamical systems
- The refinement calculus of reactive systems
- Monitoring metric first-order temporal properties
- Timed CSP = closed timed automata
- Observable behavior of dynamic systems: component reasoning for concurrent objects
- Model-checking linear-time properties of quantum systems
- An abstract interpretation-based model for safety semantics
- Liveness-Preserving Atomicity Abstraction
- Do we need liveness? Approximation of liveness properties by safety properties
- Introduction to model checking
- Functional specification of hardware via temporal logic
- Asynchronous message orderings beyond causality
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
- Deciding safety and liveness in TPTL
- Topology
- An interface theory for service-oriented design
- Assurance of dynamic adaptation in distributed systems
- Observable behavior of distributed systems: component reasoning for concurrent objects
- Revisiting safety and liveness in the context of failures
- Liveness in timed and untimed systems
- A sound and complete reasoning system for asynchronous communication with shared futures
- Linear temporal logic symbolic model checking
- Which security policies are enforceable by runtime monitors? A survey
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
- Abstraction and composition: a verification method for co-operating systems
- A case study in the mechanical verification of fault tolerance
- A Branching Time Logical System for Open Distributed Systems Development
- Multi-parameterised compositional verification of safety properties
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
- Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
- Fairness and hyperfairness
- Safety assurance via on-line monitoring
- Quantitative model-checking of controlled discrete-time Markov processes
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
- Characterization of temporal property classes
- Direct formal verification of liveness properties in continuous and hybrid dynamical systems
- CRDT
- Verifying Parameterized taDOM+ Lock Managers
- Runtime enforcement monitors: Composition, synthesis, and enforcement abilities
- Unwinding Possibilistic Security Properties
- Enforcing non-safety security policies with program monitors
- Power of Randomization in Automata on Infinite Strings
- CONCUR 2005 – Concurrency Theory
- Verification, Model Checking, and Abstract Interpretation
- A topological perspective on distributed network algorithms
- Synchronous \(t\)-resilient consensus in arbitrary graphs
- Quantitative safety and liveness
- Just testing
- HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
- Finite-word hyperlanguages
- Realizable and context-free hyperlanguages
- Model-based construction and verification of critical systems using composition and partial refinement
- Spatio-temporal model-checking of cyber-physical systems using graph queries
- Towards Logical Specification of Statistical Machine Learning
This page was built for publication: Defining liveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1064056)