Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22944-2_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Model-Checking Over Multi-Valued Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

Partial Order Reductions for Model Checking Temporal-Epistemic Logics Over Interleaved Multi-Agent Systems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

On-Line Model-Checking for Finite Linear Temporal Logic Specifications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Model Checking Logics for Communicating Sequential Agents

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Multi-Valued Modal Fixed Point Logics for Model Checking

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

The Complexity of Model Checking for Propositional Default Logics

Data and Knowledge Engineering
Information SystemsManagement
2005English

Partition Logics of Automata

Il Nuovo Cimento B Series 11
1994English

Branching-Time Model Checking of Parametric One-Counter Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy