Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
59
views
4
references
Top references
cited by
23
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,081
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Formal Techniques for Networked and Distributed Sytems — FORTE 2002
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
other
Author(s):
Dimitra Giannakopoulou
,
Flavio Lerda
Publication date
(Online):
November 5 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
4
Record
: found
Abstract
: not found
Article
: not found
The model checker SPIN
G.J. Holzmann
(1997)
0
comments
Cited
226
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Memory-efficient algorithms for the verification of temporal properties
M Yannakakis
,
C. Courcoubetis
,
M Vardi
…
(1992)
0
comments
Cited
55
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Model checking programs
K. Havelund
,
G. Brat
,
W. VISSER
…
(2000)
0
comments
Cited
26
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
November 5 2002
Pages
: 308-326
DOI:
10.1007/3-540-36135-9_20
SO-VID:
29377bc4-ff06-4582-b45f-5de99316e0de
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 243
Bounded Model Checking for Timed Systems
pp. 308
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
Similar content
5,081
Learning to complement Büchi automata
Authors:
Y Li
,
A. Turrini
,
L Zhang
…
Büchi's model based analysis of local anesthetic action in procaine hydrochloride: Vibrational spectroscopic approach
Authors:
V.S. Jayakumar
,
Y. Sheeba Sherlin
,
T. Vijayakumar
…
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids
Authors:
Zoltán Fülöp
,
Torsten Stüber
,
Heiko Vogler
See all similar
Cited by
23
LTL Satisfiability Checking
Authors:
Kristin Y. Rozier
,
Moshe Vardi
On-the-Fly Emptiness Checks for Generalized Büchi Automata
Authors:
Jean-Michel COUVREUR
,
Alexandre Duret-Lutz
,
Denis Poitrenaud
Automata-Theoretic Model Checking Revisited
Authors:
Moshe Vardi
See all cited by