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
12
views
20
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,781
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Axiomatizations for the perpetual loop in process algebra
other
Author(s):
Wan Fokkink
Publication date
(Online):
June 8 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
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Most cited references
20
Record
: found
Abstract
: not found
Book Chapter
: not found
Concurrency and automata on infinite sequences
David Park
(1981)
0
comments
Cited
119
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Process algebra for synchronous communication
J.A. Bergstra
,
J.W. Klop
(1984)
0
comments
Cited
76
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
D. Kozen
(1994)
0
comments
Cited
60
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1997
Publication date (Online):
June 8 2005
Pages
: 571-581
DOI:
10.1007/3-540-63165-8_212
SO-VID:
2d8a1c86-9b82-46b7-91fd-3914e8591b17
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Graphical calculi for interaction
pp. 2
NP-completeness: A retrospective
pp. 7
The LEDA platform for combinatorial and geometric computing
pp. 17
The Wadge-Wagner hierarchy of ω-rational sets
pp. 36
From chaotic iteration to constraint propagation
pp. 56
DNA2DNA computations: A potential “killer app”?
pp. 65
Tilings and quasiperiodicity
pp. 76
Enumerative sequences of leaves in rational trees
pp. 87
A completion algorithm for codes with bounded synchronization delay
pp. 98
The expressibility of languages and relations by word equations
pp. 110
Finite loops recognize exactly the regular open languages
pp. 121
An abstract data type for real numbers
pp. 132
Recursive computational depth
pp. 143
Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
pp. 154
Monadic simultaneous rigid E-unification and related problems
pp. 166
Computability on the probability measures on the Borel sets of the unit interval
pp. 177
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
pp. 188
Results on resource-bounded measure
pp. 195
Randomization and nondeterminism are comparable for ordered read-once branching programs
pp. 203
Checking properties of polynomials
pp. 214
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
pp. 225
Game theoretic analysis of call-by-value computation
pp. 237
On modular properties of higher order extensional lambda calculi
pp. 248
On explicit substitutions and names (extended abstract)
pp. 259
On the dynamics of sharing graphs
pp. 270
Minimizing diameters of dynamic trees
pp. 281
Improving spanning trees by upgrading nodes
pp. 292
Dynamic algorithms for graphs of bounded treewidth
pp. 303
The name discipline of uniform receptiveness (extended abstract)
pp. 314
On confluence in the π-calculus
pp. 325
A proof theoretical approach to communication
pp. 336
Solving trace equations using lexicographical normal forms
pp. 347
Star-free picture expressions are strictly weaker than first-order logic
pp. 358
An algebra-based method to associate rewards with EMPA terms
pp. 369
A semantics preserving actor translation
pp. 379
Periodic and non-periodic min-max equations
pp. 390
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
pp. 408
Computation paths logic: An expressive, yet elementary, process logic
pp. 419
Model checking the full modal mu-calculus for infinite sequential processes
pp. 430
Symbolic model checking for probabilistic processes
pp. 441
On the concentration of the height of binary search trees
pp. 449
An improved master theorem for divide-and-conquer recurrences
pp. 460
Bisimulation for probabilistic transition systems: A coalgebraic approach
pp. 471
Distributed processes and location failures
pp. 482
Basic observables for processes
pp. 493
Constrained bipartite edge coloring with applications to wavelength routing
pp. 505
Colouring paths in directed symmetric trees with applications to WDM routing
pp. 516
On-line routing in all-optical networks
pp. 527
A complete characterization of the path layout construction problem for ATM networks with given hop count and load
pp. 538
Efficiency of asynchronous systems and read arcs in petri nets
pp. 549
Bisimulation equivalence is decidable for one-counter processes
pp. 560
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
pp. 571
Axiomatizations for the perpetual loop in process algebra
pp. 582
Discrete-time control for rectangular hybrid automata
pp. 594
Maintaining minimum spanning trees in dynamic graphs
pp. 605
Efficient splitting and merging algorithms for order decomposable problems
pp. 616
Efficient array partitioning
pp. 627
Constructive linear time algorithms for branchwidth
pp. 638
The word matching problem is undecidable for finite special string-rewriting systems that are confluent
pp. 649
The geometry of orthogonal reduction spaces
pp. 660
The theory of vaccines
pp. 671
The equivalence problem for deterministic pushdown automata is decidable
pp. 682
On recognizable and rational formal power series in partially commuting variables
pp. 693
On a conjecture of J. Shallit
pp. 705
On characterizations of escrow encryption schemes
pp. 716
Randomness-efficient non-interactive zero knowledge
pp. 727
Approximation results for the optimum cost chromatic partition problem
pp. 738
The minimum color sum of bipartite graphs
pp. 749
A primal-dual approach to approximation of node-deletion problems for matroidal properties
pp. 760
Independent sets in asteroidal triple-free graphs
pp. 771
Refining and compressing abstract domains
pp. 782
Labelled reductions, runtime errors, and operational subsumption
pp. 794
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
pp. 805
Recognizability equals definability for partial k-paths
pp. 816
Molecular computing, bounded nondeterminism, and efficient recursion
pp. 827
Constructing big trees from short sequences
pp. 838
Termination of constraint logic programs
pp. 849
The expressive power of unique total stable model semantics
Similar content
3,781
Getting Axiomatic About Learning Objects
Authors:
D Wiley
,
D. WILEY
An Axiomatic Approach to Routing
Authors:
Omer Lev
,
Moshe Tennenholtz
,
Aviv Zohar
Proofs of valid categorical syllogisms in one diagrammatic and two symbolic axiomatic systems
Authors:
Antonielly Garcia Rodrigues
,
Eduardo Mario Dias
See all similar
Cited by
2
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators
Authors:
Luca Aceto
,
Eugen-Ioan Goriac
,
Anna Ingolfsdottir
Modeling Terms by Graphs with Structure Constraints (Two Illustrations)
Authors:
Clemens Grabmayer
See all cited by