An Equivalent CTL Formulation for Condition Sequences

Authors:
Jeffrey Ashley;Lawrence E. Holloway
Affiliations:
Center for Manufacturing, University of Kentucky, Lexington, USA 40506;Department of Electrical and Computer Engineering and Center for Manufacturing, University of Kentucky, Lexington, USA 40506
Venue:
Discrete Event Dynamic Systems
Year:
2005

Citing 6
Cited 0

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Logic in computer science: modelling and reasoning about systems

Logic in computer science: modelling and reasoning about systems
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Qualitative Diagnosis of Condition Systems

Discrete Event Dynamic Systems
Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications

SIAM Journal on Control and Optimization
Automated synthesis and composition of taskblocks for control ofmanufacturing systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A condition system is a form of Petri net that interacts with other condition systems and the environment via state-based signals called conditions. The condition language framework has been used in previous papers to characterize the input/output behavior of such interacting systems, as well as to specify desired control behavior among other things. In this paper, we show that condition sequences (the specification) and condition systems (the model of the system) have an equivalent structure in the computation tree logic (CTL) framework. The primary goals of this work are to be able to utilize existing tools for program verification for our systems, and to make our work more accessible to the temporal logic community.