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
29
views
1
references
Top references
cited by
16
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,238
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
FAST: Fast Acceleration of Symbolic Transition Systems
other
Author(s):
Sébastien Bardin
,
Alain Finkel
,
Jérôme Leroux
,
Laure Petrucci
Publication date
(Print):
2003
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
Socioecological systems
Most cited references
1
Record
: found
Abstract
: not found
Book Chapter
: not found
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
Alain Finkel
,
Jérôme Leroux
(2002)
0
comments
Cited
35
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 118-121
DOI:
10.1007/978-3-540-45069-6_12
SO-VID:
69d84932-9d1e-4b91-b1ff-2a6d9e4bf628
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 80
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
pp. 118
FAST: Fast Acceleration of Symbolic Transition Systems
pp. 141
A Symbolic Approach to Predicate Abstraction
pp. 167
Digitizing Interval Duration Logic
pp. 210
TLQSolver: A Temporal Logic Query Checker
pp. 223
Iterating Transducers in the Large
pp. 236
Algorithmic Improvements in Regular Model Checking
pp. 262
Thread-Modular Abstraction Refinement
pp. 315
Domain-Specific Optimization in Automata Learning
pp. 355
Theorem Proving Using Lazy Proof Explication
pp. 368
Enhanced Vacuity Detection in Linear Temporal Logic
Similar content
2,238
Constructive Multiuser Interference in Symbol Level Precoding for the MISO Downlink Channel
Authors:
Maha Alodeh
,
Symeon Chatzinotas
,
Bjorn Ottersten
The symbolic significance of motifs on selected Asante religious temples
Authors:
E.A. Asante
,
S. Kquofi
,
S Larbi
From graphs to tensegrity structures: Geometric and symbolic approaches
Authors:
Miguel de Guzmán
,
David Orden
See all similar
Cited by
16
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Authors:
J.-F. Raskin
,
L. Van Begin
,
G. Geeraerts
Constraint-Based Linear-Relations Analysis
Authors:
Sriram Sankaranarayanan
,
Henny B. Sipma
,
Zohar Manna
Programs with Lists Are Counter Automata
Authors:
Ahmed Bouajjani
,
Marius Bozga
,
Peter Habermehl
…
See all cited by