Inductive Verification of Hybrid Automata With Strongest Postcondition Calculus

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

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Discretizing Affine Hybrid Automata With Uncertainty

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Automated Inductive Verification of Parameterized Protocols?

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Hybrid State Petri Nets Which Have the Analysis Power of Stochastic Hybrid Systems and the Formal Verification Power of Automata

2010English

Simply Typed Fixpoint Calculus and Collapsible Pushdown Automata

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2015English

Characterization of 2D Hybrid Cellular Automata With Periodic Boundary

Acta Physica Polonica A
AstronomyPhysics
2017English

Monitoring of Dynamical Systems Using Hybrid Automata With Stopwatch

The Open Automation and Control Systems Journal
2017English

A Finitary Version of the Calculus of Partial Inductive Definitions

English

Automata for the Mu-Calculus and Related Results

BRICS Report Series
1995English

Verification of Networks of Timed Automata Using mCRL2

2008 IEEE International Symposium on Parallel and Distributed Processing
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy