(Hybrid) automata and (stochastic) programsThe hybrid automata lattice of a stochastic program

  title={(Hybrid) automata and (stochastic) programsThe hybrid automata lattice of a stochastic program},
  author={Luca Bortolussi and Alberto Policriti},
  journal={J. Log. Comput.},
We define a semantics for stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra, in terms of stochastic hybrid automata with piecewise deterministic continuous dynamics. To each program we associate a lattice of hybrid models, parameterized with respect to the degree of discreteness left. We study some properties of this lattice, presenting also an alternative semantics in which the degree of discreteness can be dynamically changed. 

Figures from this paper

Hybrid behaviour of Markov population models

Stochastic HYPE: Flow-based modelling of stochastic hybrid systems

A novel equivalence is defined which captures when two models have the same stochastic behaviour, instantaneous behaviour (as in classical bisimulation) and continuous behaviour and is illustrated via an assembly line example.

On the Robustness of Temporal Properties for Stochastic Models

The notion of robustness is extended to stochastic systems, showing that this naturally leads to a distribution of robusts scores, and how to approximate the distribution of the robustness score and its key indicators: the average robustness and the conditional average robusts.

Towards a Stochastic Occurrence-Based Modeling Approach for Stochastic CPSs

  • B. ChengDehui Du
  • Computer Science
    2014 Theoretical Aspects of Software Engineering Conference
  • 2014
This paper gives the formal syntax and semantics of SOHA based on labeled transition system and proposes a SOHA-based modeling approach that provides a more reasonable way to concisely model stochastic hybrid systems with the use of refinement and Stochastic abstraction.

Learning and Designing Stochastic Processes from Logical Constraints

This work adapts a recently proposed, provably convergent global optimisation algorithm developed in the machine learning community, and demonstrates its efficacy on a number of non-trivial test cases.

Hybrid semantics for Bio-PEPA

Hybrid models of the cell cycle molecular machinery

This work presents an approach, inspired from tropical geometry ideas, allowing to reduce, hybridize and analyse cell cycle models consisting of polynomial or rational ordinary differential equations.



Stochastic Programs and Hybrid Automata for (Biological) Modeling

The aim of this construction is to provide a framework to approximate the stochastic behavior by a mixed discrete/continuous dynamics with a variable degree of discreteness.

Hybrid dynamics of stochastic programs

Hybrid Dynamics of Stochastic π-Calculus

A method to map stochastic π-calculus processes in chemical ground form into hybrid automata to implement a separation of control and molecular terms in biochemical systems is described.

The theory of hybrid automata

  • T. Henzinger
  • Computer Science
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
The goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.

Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration

The specific contribution in this work consists in an increase of the flexibility of the translation scheme, obtained by allowing a dynamic reconfiguration of the degree of discreteness/continuity of the semantics.

Stochastic Concurrent Constraint Programming

  • L. Bortolussi
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2006

Limit Behavior of the Hybrid Approximation of Stochastic Process Algebras

It is proved that a sequence of Continuous Time Markov Chain (CTMC), constructed from sCCP programs parametrically with respect to a notion of system size, converges a.s., in the limit of divergent size, to the hybrid approximation.

A Theory of Timed Automata

What's decidable about hybrid automata?

It is proved that the reachability problem is undecidable for timed automata augmented with a single stopwatch, and an (optimal) PSPACE reachability algorithm is given for the case of initialized rectangular automata.

HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour

This work proposes a process algebras for modelling hybrid systems called HYPE which offers finer-grained modelling with each flow or influence affecting a variable modelled separately, and which is supported by an operational semantics which distinguishes states as collections of flows.