Hierarchical and recursive state machines with context-dependent properties

Authors:
Salvatore La Torre;Margherita Napoli;Mimmo Parente;Gennaro Parlato
Affiliations:
Dipartimento di Informatica e Applicazioni, Università degli Studi di Salerno;Dipartimento di Informatica e Applicazioni, Università degli Studi di Salerno;Dipartimento di Informatica e Applicazioni, Università degli Studi di Salerno;Dipartimento di Informatica e Applicazioni, Università degli Studi di Salerno
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 10
Cited 0

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Object-oriented modeling and design

Object-oriented modeling and design
Real-time object-oriented modeling

Real-time object-oriented modeling
Computer-aided verification

IEEE Spectrum
The Unified Modeling Language user guide

The Unified Modeling Language user guide
Modular refinement of hierarchic reactive machines

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking of hierarchical state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Reachability Analysis of Hierarchical Reactive Machines

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by allowing atomic propositions to label all the kinds of vertices and not only basic nodes. We call the obtained models context-dependent hierarchical/recursive state machines. We study on such models cycle detection, reachability and LTL model-checking. Despite of a more succinct representation, we prove that LTL model-checking can be done in time linear in the size of the model and exponential in the size of the formula, as for standard LTL model-checking. Reachability and cycle detection become NP-complete, and if we place some restrictions on the representation of the target states, we can decide them in time linear in the size of the formula and the size of the model.