Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
34
views
14
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
2,904
similar
All similar
Record
: found
Abstract
: found
Book Chapter
: found
Is Open Access
Tools and Algorithms for the Construction and Analysis of Systems
Permutation Games for the Weakly Aconjunctive \(\mu \)μ-Calculus
other
Author(s):
Daniel Hausmann
,
Lutz Schröder
,
Hans-Peter Deifel
Publication date
(Online):
April 14 2018
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Download
XML
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
14
Record
: found
Abstract
: not found
Article
: not found
Results on the propositional μ-calculus
Dexter Kozen
(1983)
0
comments
Cited
209
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Games for the μ-calculus
Igor Walukiewicz
,
Damian Niwinski
(1996)
0
comments
Cited
17
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Complexity of Tree Automata and Logics of Programs
E. Allen Emerson
,
Charanjit Jutla
(1999)
0
comments
Cited
12
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
April 14 2018
Pages
: 361-378
DOI:
10.1007/978-3-319-89963-3_21
SO-VID:
a3a7156b-17e6-4e64-aa21-4c16add4401f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets
pp. 20
Fine-Grained Complexity of Safety Verification
pp. 38
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks
pp. 55
EMME: A Formal Tool for ECMAScript Memory Model Evaluation
pp. 75
What a Difference a Variable Makes
pp. 93
Abstraction Refinement for Emptiness Checking of Alternating Data Automata
pp. 112
Revisiting Enumerative Instantiation
pp. 132
A Non-linear Arithmetic Procedure for Control-Command Software Verification
pp. 155
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection
pp. 176
Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
pp. 194
$$\text {RVHyper}$$RVHyper: A Runtime Verification Tool for Temporal Hyperproperties
pp. 201
The Refinement Calculus of Reactive Systems Toolset
pp. 211
TESTOR: A Modular Tool for On-the-Fly Conformance Test Case Generation
pp. 229
Optimal Dynamic Partial Order Reduction with Observers
pp. 249
Structurally Defined Conditional Data-Flow Static Analysis
pp. 266
Geometric Nontermination Arguments
pp. 287
Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis
pp. 303
AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic
pp. 320
Multi-cost Bounded Reachability in MDP
pp. 340
A Statistical Model Checker for Nondeterminism and Rare Events
pp. 361
Permutation Games for the Weakly Aconjunctive $$\mu $$μ-Calculus
pp. 379
Symmetry Reduction for the Local Mu-Calculus
pp. 396
Bayesian Statistical Parameter Synthesis for Linear Temporal Properties of Stochastic Models
pp. 417
2LS: Memory Safety and Non-termination
pp. 422
YOGAR-CBMC: CBMC with Scheduling Constraint Based Abstraction Refinement
pp. 427
CPA-BAM-Slicing: Block-Abstraction Memoization and Slicing with Region-Based Dependency Analysis
pp. 432
InterpChecker: Reducing State Space via Interpolations
pp. 437
Map2Check Using LLVM and KLEE
pp. 442
Symbiotic 5: Boosted Instrumentation
pp. 447
Ultimate Automizer and the Search for Perfect Interpolants
pp. 452
Ultimate Taipan with Dynamic Block Encoding
pp. 457
VeriAbs: Verification by Abstraction and Test Generation
Similar content
2,904
Several classes of complete permutation polynomials
Authors:
Xiangyong Zeng
,
Ziran Tu
,
Lei Hu
Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns
Authors:
Elisa Pergola
,
Antonio Bernini
Clustering of consecutive numbers in permutations under a Mallows distribution
Authors:
Ross Pinsky
See all similar
Cited by
2
Optimal Satisfiability Checking for Arithmetic \(\mu\)-Calculi
Authors:
Daniel Hausmann
,
Lutz Werner Schröder
Optimal Satisfiability Checking for Arithmetic \(\mu \) -Calculi
Authors:
Daniel Hausmann
,
Lutz Werner Schröder
See all cited by