On a decidable formal theory for abstract continuous-time dynamical systems

Ievgen Ivanov; Mykola Nikitchenko; Uri Abraham

doi:10.1007/978-3-319-13206-8_4

On a decidable formal theory for abstract continuous-time dynamical systems

Ievgen Ivanov, Mykola Nikitchenko, Uri Abraham

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We propose a decidable formal theory which describes high-level properties of abstract continuous-time dynamical systems called Nondeterministic Complete Markovian Systems (NCMS). NCMS is a rather general class of systems which can represent discrete and/or continuous evolutions in continuous time and which is sufficient for modeling a wide range of real-time information processing and cyber-physical systems (CPS).We illustrate the obtained results with a proof of the mutual exclusion property of a CPS which implements Peterson’s algorithm.

Original language	English
Pages (from-to)	78-99
Number of pages	22
Journal	Communications in Computer and Information Science
Volume	469
DOIs	https://doi.org/10.1007/978-3-319-13206-8_4
State	Published - 1 Jan 2014

Keywords

Continuous-time system
Cyber-physical system
Decidability
Dynamical system
Formal theory
Real-time system
Verification

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1007/978-3-319-13206-8_4

Cite this

@article{15289b47ec5b48b8afe9206f616580c3,

title = "On a decidable formal theory for abstract continuous-time dynamical systems",

abstract = "We propose a decidable formal theory which describes high-level properties of abstract continuous-time dynamical systems called Nondeterministic Complete Markovian Systems (NCMS). NCMS is a rather general class of systems which can represent discrete and/or continuous evolutions in continuous time and which is sufficient for modeling a wide range of real-time information processing and cyber-physical systems (CPS).We illustrate the obtained results with a proof of the mutual exclusion property of a CPS which implements Peterson{\textquoteright}s algorithm.",

keywords = "Continuous-time system, Cyber-physical system, Decidability, Dynamical system, Formal theory, Real-time system, Verification",

author = "Ievgen Ivanov and Mykola Nikitchenko and Uri Abraham",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-13206-8_4",

language = "English",

volume = "469",

pages = "78--99",

journal = "Communications in Computer and Information Science",

issn = "1865-0929",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - On a decidable formal theory for abstract continuous-time dynamical systems

AU - Ivanov, Ievgen

AU - Nikitchenko, Mykola

AU - Abraham, Uri

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2014.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We propose a decidable formal theory which describes high-level properties of abstract continuous-time dynamical systems called Nondeterministic Complete Markovian Systems (NCMS). NCMS is a rather general class of systems which can represent discrete and/or continuous evolutions in continuous time and which is sufficient for modeling a wide range of real-time information processing and cyber-physical systems (CPS).We illustrate the obtained results with a proof of the mutual exclusion property of a CPS which implements Peterson’s algorithm.

AB - We propose a decidable formal theory which describes high-level properties of abstract continuous-time dynamical systems called Nondeterministic Complete Markovian Systems (NCMS). NCMS is a rather general class of systems which can represent discrete and/or continuous evolutions in continuous time and which is sufficient for modeling a wide range of real-time information processing and cyber-physical systems (CPS).We illustrate the obtained results with a proof of the mutual exclusion property of a CPS which implements Peterson’s algorithm.

KW - Continuous-time system

KW - Cyber-physical system

KW - Decidability

KW - Dynamical system

KW - Formal theory

KW - Real-time system

KW - Verification

UR - http://www.scopus.com/inward/record.url?scp=84914168896&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-13206-8_4

DO - 10.1007/978-3-319-13206-8_4

M3 - Article

AN - SCOPUS:84914168896

SN - 1865-0929

VL - 469

SP - 78

EP - 99

JO - Communications in Computer and Information Science

JF - Communications in Computer and Information Science

ER -

On a decidable formal theory for abstract continuous-time dynamical systems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this