Regular automata and model checking

View Related Documents

Journal Article
Branching Time Logics BTL^U,S_N,N^-1(Z)_a\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha } with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
V. Rybakov
Theory of Computing Systems, 2008, Volume 43, Number 2, Pages 254-271
- Download PDF (471.2 KB)
Book Chapter
CCS, liveness, and local model checking in the linear time mu-calculus
Colin Stirling and David Walker
Lecture Notes in Computer Science, 1990, Volume 407, Automatic Verification Methods for Finite State Systems, Pages 166-178
- Download PDF (790.8 KB)
Book Chapter
Hierarchical development of concurrent systems in a temporal logic framework
Howard Barringer and Ruurd Kuiper
Lecture Notes in Computer Science, 1985, Volume 197, Seminar on Concurrency, Pages 35-61
- Download PDF (1.2 MB)
Book Chapter
Computation tree logic and regular ω-languages
Wolfgang Thomas
Lecture Notes in Computer Science, 1989, Volume 354, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Pages 690-713
- Download PDF (1.4 MB)
Book Chapter
Branching time temporal logic
E. Allen Emerson and Jai Srinivasan
Lecture Notes in Computer Science, 1989, Volume 354, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Pages 123-172
- Download PDF (4.5 MB)
Book Chapter
Automated temporal reasoning about reactive systems
E. Allen Emerson
Lecture Notes in Computer Science, 1996, Volume 1043, Logics for Concurrency, Pages 41-101
- Download PDF (3.3 MB)
Journal Article
Model Checking for a Class of Weighted Automata
Peter Buchholz and Peter Kemper
Discrete Event Dynamic Systems, 2010, Volume 20, Number 1, Pages 103-137
- Download PDF (845.1 KB)
- View HTML
Book Chapter
Efficient Algorithms for Model Checking Pushdown Systems
Javier Esparza, David Hansel, Peter Rossmanith and Stefan Schwoon
Lecture Notes in Computer Science, 2000, Volume 1855, Computer Aided Verification, Pages 232-247
- Download PDF (255.3 KB)
Book Chapter
On Reduction Criteria for Probabilistic Reward Models
Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski and Marta Kwiatkowska, et al.
Lecture Notes in Computer Science, 2006, Volume 4337, FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, Pages 309-320
- Download PDF (312.3 KB)
Book Chapter
Gentzen-Systems for propositional temporal logics
Barbara Paech
Lecture Notes in Computer Science, 1989, Volume 385, CSL '88, Pages 240-253
- Download PDF (588.1 KB)

Abstract

We present a class of the temporal branching time logics designated for the specification of concurrent programs and incorporating all regular temporal operators. A linear time model checking procedure is given due to which an efficient verification of the temporal dependencies in programs is possible.

Fulltext Preview

Image of the first page of the fulltext document

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

SpringerLink

Regular automata and model checking

View Related Documents

Abstract

Fulltext Preview