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
23
views
12
references
Top references
cited by
17
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
999
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
The Polyranking Principle
other
Author(s):
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
Publication date
(Print):
2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
12
Record
: found
Abstract
: not found
Book Chapter
: not found
A Complete Method for the Synthesis of Linear Ranking Functions
Andreas Podelski
,
Andrey Rybalchenko
(2004)
0
comments
Cited
68
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Transition invariants
A. Podelski
,
A. Rybalchenko
(2004)
0
comments
Cited
37
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Linear Ranking with Reachability
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
(2005)
0
comments
Cited
35
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 1349-1361
DOI:
10.1007/11523468_109
SO-VID:
693263df-a5ed-4de4-a536-6edb43380ec9
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 16
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
pp. 791
Boneh-Franklin Identity Based Encryption Revisited
pp. 956
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
pp. 153
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
pp. 191
Measure and Conquer: Domination – A Case Study
pp. 249
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
pp. 261
Deterministic Constructions of Approximate Distance Oracles and Spanners
pp. 347
On the Wake-Up Problem in Radio Networks
pp. 513
Weighted Automata and Weighted Logics
pp. 589
Simulated Annealing Beats Metropolis in Combinatorial Optimization
pp. 627
Reordering Buffer Management for Non-uniform Cost Models
pp. 677
On the Cover Time of Random Geometric Graphs
pp. 779
Completely Non-malleable Schemes
pp. 803
Single-Database Private Information Retrieval with Constant Communication Rate
pp. 878
The Complexity of Stochastic Rabin and Streett Games
pp. 1018
An Accessible Approach to Behavioural Pseudometrics
pp. 1043
A Better Approximation Ratio for the Vertex Cover Problem
pp. 1089
Decidability and Complexity Results for Timed Automata via Channel Machines
pp. 1102
Congruences for Visibly Pushdown Languages
pp. 1115
Approximation Algorithms for Euclidean Group TSP
pp. 1202
A Fully Abstract Encoding of the π-Calculus with Data Terms
pp. 1349
The Polyranking Principle
pp. 1450
Unsafe Grammars and Panic Automata
Similar content
999
3D printing: Principles and pharmaceutical applications of selective laser sintering
Authors:
Atheer Awad
,
Fabrizio Fina
,
Alvaro Goyanes
…
Investigation of nodal line spin-gapless semiconductors using first-principles calculations
Authors:
Guangqian Ding
,
Jianhuan Wang
,
Hong Chen
…
Long-Term Prediction of Creep and Stress-Relaxation Behaviour in Synthetic Fabrics Using the Time–Temperature Superposition Principle
Authors:
Neeraj Mandlekar
,
Bharti Rana
,
Pooja Maurya
…
See all similar
Cited by
17
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Authors:
Christophe Alias
,
Alain Darte
,
Paul Feautrier
…
Ramsey vs. Lexicographic Termination Proving
Authors:
Byron Cook
,
Abigail See
,
Florian Zuleger
Better Termination Proving through Cooperation
Authors:
Marc Brockschmidt
,
Byron Cook
,
Carsten Fuhs
See all cited by