Shortest Counterexamples for Symbolic Model Checking of LTL With Past

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-31980-1_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Bringing LTL Model Checking to Biologists

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Another Look at LTL Model Checking

1993English

Counterexamples in Probabilistic Model Checking

English

Context-Bounded Model Checking of LTL Properties for ANSI-C Software

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Symbolic Model Checking for Simply-Timed Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Generalized Symbolic Execution for Model Checking and Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Conformant Planning via Symbolic Model Checking

Journal of Artificial Intelligence Research
Artificial Intelligence
2000English

Dual-Processor Parallelisation of Symbolic Probabilistic Model Checking

English

Symbolic Model-Checking for Abstracting Inevitability Modalities Over Transient States

International Journal of Control and Automation
ControlSystems Engineering
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy