A partial order approach to branching time logic model checking.
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Characterizing finite Kripke structures in propositional temporal logic
- scientific article; zbMATH DE number 4157900 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 177254 (Why is no real title available?)
- scientific article; zbMATH DE number 177511 (Why is no real title available?)
- scientific article; zbMATH DE number 177845 (Why is no real title available?)
Cited in
(36)- Partial-order reduction techniques for real-time model checking
- Deciding global partial-order properties
- On stubborn sets in the verification of linear time temporal properties
- Modalities for model checking: Branching time logic strikes back
- Compositional verification of concurrent systems by combining bisimulations
- Exponential automatic amortized resource analysis
- The inconsistent labelling problem of stutter-preserving partial-order reduction
- A survey on temporal logics for specifying and verifying real-time systems
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
- Branching bisimulation games
- Partial model checking using networks of labelled transition systems and Boolean equation systems
- Partial order reduction for checking LTL formulae with the next-time operator
- Partial-Order Reduction
- Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
- scientific article; zbMATH DE number 177510 (Why is no real title available?)
- scientific article; zbMATH DE number 1337727 (Why is no real title available?)
- scientific article; zbMATH DE number 1059330 (Why is no real title available?)
- scientific article; zbMATH DE number 1507206 (Why is no real title available?)
- scientific article; zbMATH DE number 1515293 (Why is no real title available?)
- Transparent partial order reduction
- Compositionality in state space verification methods
- Hyper partial order logic
- A detailed account of the inconsistent labelling problem of stutter-preserving partial-order reduction
- Partial-order reduction for parity games with an application on parameterised Boolean equation systems
- Model-checking games for fixpoint logics with partial order models
- Stubborn set reduction for two-player reachability games
- Partial-order reduction in the weak modal mu-calculus
- Adding partial orders to linear temporal logic
- Equivalence checking 40 years after: a review of bisimulation tools
- Taking Some Burden Off an Explicit CTL Model Checker
- Confluence for process verification
- Unified bisimulation applied to incremental abstraction of Petri nets
- Translating Java for multiple model checkers: The Bandera back-end
- Stubborn set reduction for timed reachability and safety games
- Question-guided stubborn set methods for state properties
- Combining partial-order reductions with on-the-fly model-checking.
This page was built for publication: A partial order approach to branching time logic model checking.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854268)
