IEICE TRANSACTIONS on Fundamentals
Making Reactive Systems Highly Reliable by Hypersequential Programming
Summary :
Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.4 pp.941-947
- Publication Date
- 2005/04/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.4.941
- Type of Manuscript
- Special Section PAPER (Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Naoshi UCHIHIRA, "Making Reactive Systems Highly Reliable by Hypersequential Programming" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 4, pp. 941-947, April 2005, doi: 10.1093/ietfec/e88-a.4.941.
Abstract: Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.4.941/_p
Copy
@ARTICLE{e88-a_4_941,
author={Naoshi UCHIHIRA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Making Reactive Systems Highly Reliable by Hypersequential Programming},
year={2005},
volume={E88-A},
number={4},
pages={941-947},
abstract={Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.},
keywords={},
doi={10.1093/ietfec/e88-a.4.941},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Making Reactive Systems Highly Reliable by Hypersequential Programming
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 941
EP - 947
AU - Naoshi UCHIHIRA
PY - 2005
DO - 10.1093/ietfec/e88-a.4.941
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2005
AB - Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.
ER -
English
