Skip to content
<title>Channels - Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems
Search for more channels:
Similar Items: Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems
Channel Options
View Record
Explore related channels
Quick Look
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Quick Look
EXPTIME Tableaux for the Coalgebraic mu-Calculus
Quick Look
Intersection Types for the lambda-mu Calculus
Quick Look
$aleph_1$ and the modal $mu$-calculus
Quick Look
Scalar and Vectorial mu-calculus with Atoms
Quick Look
Enriched MU-Calculi Module Checking
Quick Look
Probabilistic modal {mu}-calculus with independent product
Quick Look
Coalgebraic Satisfiability Checking for Arithmetic $mu$-Calculi
Quick Look
On the equivalence of game and denotational semantics for the probabilistic mu-calculus
Quick Look
Some model theory for the modal $mu$-calculus: syntactic characterisations of semantic properties
Quick Look
Linear Encodings of Bounded LTL Model Checking
Quick Look
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
Quick Look
Lineal: A linear-algebraic Lambda-calculus
Quick Look
Two Variable vs. Linear Temporal Logic in Model Checking and Games
Quick Look
Linear-use CPS translations in the Enriched Effect Calculus
Quick Look
A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications
Quick Look
The Complexity of Enriched Mu-Calculi
Quick Look
Adding Negation to Lambda Mu
Quick Look
Type Reconstruction for the Linear pi-Calculus with Composite Regular Types
Quick Look
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi
Quick Look
Model Checking Synchronized Products of Infinite Transition Systems
Quick Look
Ordered Models of the Lambda Calculus
Quick Look
Model Checking Vector Addition Systems with one zero-test
Quick Look
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
Load more items
View Record
Prev
Explore related channels
Next
