Branching-Time Model Checking of Parametric One-Counter Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-28729-9_27
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Branching-Time Model Checking Gap-Order Constraint Systems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2016English

Model Checking of Multitasking Real-Time Applications Based on the Timed Automata Model Using One Clock

2010English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Timed-Automata Based Model-Checking of a Multi-Agent System: A Case Study

Journal of Software Engineering and Applications
2015English

A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Programs With Lists Are Counter Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2011English

A Timed Failure Equivalence Preserving Abstraction for Parametric Time-Interval Automata

International Journal of Foundations of Computer Science
Computer Science
2006English

On Time Computability of Functions in One-Way Cellular Automata

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy