1,186 Hits in 3.9 sec

Control of Nondeterministic Discrete-Event Systems for Bisimulation Equivalence

C. Zhou, R. Kumar, S. Jiang
2006 IEEE Transactions on Automatic Control  
Nondeterministic specifications are also meaningful when the system to be controlled has a nondeterministic model due to the lack of information (caused for example by partial observation or unmodeled  ...  Language equivalence is not an adequate notion of behavioral equivalence for nondeterministic systems, and instead we use the finest known notion of equivalence, namely the bisimulation equivalence.  ...  Nondeterministic specifications are also meaningful when the system to be controlled has a nondeterministic model due to the lack of information (caused for example by partial observation or unmodeled  ... 
doi:10.1109/tac.2006.875036 fatcat:i7sdogevwrf55pivplhc36meve

Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

Jasen Markovski
2014 Discrete event dynamic systems  
We employ the behavioral preorder termed partial bisimulation to define controllability for nondeterministic discrete-event systems.  ...  We show that the equivalence relation, induced by the partial bisimulation preorder, can be employed to minimize the model of the unsupervised system.  ...  Lambregts for applying the minimization procedure to several case studies.  ... 
doi:10.1007/s10626-014-0201-y fatcat:wrg2ktfsbzgsloecrmqxj7ghue

A Small Model Theorem for Bisimilarity Control Under Partial Observation

Changyan Zhou, Ratnesh Kumar
2007 IEEE Transactions on Automation Science and Engineering  
The paper addresses the issue of control of nondeterministic systems subject to nondeterministic specifications, under a partial observation of events.  ...  The paper extends our prior result on decidability of bisimulation equivalence control reported in [7] , [8] from the setting of complete observations to that of partial observations.  ...  INTRODUCTION We study the control of nondeterministic discrete event systems (DESs). The behavior of such systems contains information about the sequencing and also the nondeterministic branching.  ... 
doi:10.1109/tase.2006.873004 fatcat:t6upxt5wfbhihnaqpljbo53axu

Bisimilarity Control of Nondeterministic Discrete Event Systems under Event and State Observations

Katsuyuki KIMURA, Shigemasa TAKAI
2014 IEICE transactions on information and systems  
supervisor. key words: discrete event system, supervisory control, nondeterministic system, bisimilarity control  ...  We define a notion of partial bisimulation between a given specification and the plant, and prove that it serves as a necessary and sufficient condition for the existence of a bisimilarity enforcing complete  ...  Toshimitsu Ushio for his helpful comments. This work was supported in part by Grant-in-Aid for Scientific Research (No. 24560547).  ... 
doi:10.1587/transinf.e97.d.1140 fatcat:l6afh6j5szdnzege53g4pbynli

A process-theoretic approach to supervisory control theory

J. C. M. Baeten, D. A. van Beek, B. Luttik, J. Markovski, J. E. Rooda
2011 Proceedings of the 2011 American Control Conference  
The new approach provides for a generalized characterization of controllability of nondeterministic discrete-event systems.  ...  To this end, we investigate partial bisimulation preorder, a behavioral preorder that is coarser than bisimulation equivalence and finer than simulation preorder.  ...  Other works tackle nondeterministic systems as a set of deterministic systems, by requiring controllability of all underlying deterministic systems to induce controllability of the nondeterministic system  ... 
doi:10.1109/acc.2011.5990831 fatcat:xabbpg23zzcvrosu44joyznxe4

Towards Supervisory Control of Interactive Markov Chains: Controllability

J. Markovski
2011 2011 Eleventh International Conference on Application of Concurrency to System Design  
We propose a model-based systems engineering framework for supervisory control of stochastic discrete-event systems with unrestricted nondeterminism.  ...  To this end, we define a new behavioral preorder, termed Markovian partial bisimulation, that captures the notion of controllability while preserving correct stochastic behavior.  ...  Acknowledgment We thank Nikola Trčka for his useful comments and remarks on a preliminary draft of this paper.  ... 
doi:10.1109/acsd.2011.18 dblp:conf/acsd/Markovski11 fatcat:y7uw5frbgbat5pcdxm2eawvif4


Sophie Pinchinat, Jean-Baptiste Raclet
2005 IFAC Proceedings Volumes  
In particular, these transformations are used to reduce control problems for nondeterministic systems to control problems under partial observation for deterministic systems.  ...  We answer a wide range of control problems for nondeterministic discrete-event systems, relying on recent works based on a second order logic approach for deterministic systems.  ...  CONCLUSION We have proposed two transformations that are used to reduce control problems for nondeterministic systems to control problems under partial observation for deterministic systems.  ... 
doi:10.3182/20050703-6-cz-1902.00296 fatcat:7dsq3giud5hmfe2dlh7wc7jn4a

Safe Equivalences for Security Properties [chapter]

Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum
2010 IFIP Advances in Information and Communication Technology  
In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference) based on the principle that a  ...  Non-safe equivalences, in this sense, include complete-trace equivalence and bisimulation.  ...  The authors wish to thank the anonymous reviewers for their useful comments, and Pedro D'Argenio for helpful discussion.  ... 
doi:10.1007/978-3-642-15240-5_5 fatcat:g5vlvv32grbi7er5b6s6nmgdym

Introduction to probabilistic automata

1972 Discrete Mathematics  
Finally, we give an overview of various other state based models that are used for the analysis of probabilistic systems.  ...  We explain how the basic concepts for the analysis of nonprobabilistic automata can be extended to probabilistic systems.  ...  Introduction being under the control of the NA, are required to be enabled in any state. The basic concepts are similar for the various definitions.  ... 
doi:10.1016/0012-365x(72)90124-0 fatcat:23vh6ok5vrdy7itfc6m47ccrnq

Forthcoming Papers

2003 Artificial Intelligence  
Undecidability is established for policy-existence problems for partially observable infinitehorizon Markov decision processes under discounted and undiscounted total reward models, averagereward models  ...  The original formulation of the problem makes strong assumptions regarding the agent's knowledge and control over the world, namely that its information is complete and correct, and that the results of  ...  Homogeneity is defined in terms of stochastic bisimulation and reward equivalence within blocks of a partition.  ... 
doi:10.1016/s0004-3702(03)00084-5 fatcat:ywtleopcbffkdcwj5isyi7b6dq

Modular supervisory control with equivalence-based conflict resolution

R. C. Hill, D. M. Tilbury, S. Lafortune
2008 2008 American Control Conference  
nondeterministic automata.  ...  Approaches for constructing these filters are discussed and it is proposed that a static state-feedback approach to control be employed that implements deterministic coordinating filter control laws by  ...  At this point, traditional techniques for control under partial observation can be applied.  ... 
doi:10.1109/acc.2008.4586539 dblp:conf/amcc/HillTL08 fatcat:276ezbm7hfhqdhvfkz2cudp5uy

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Alessandro Aldini
2020 Electronic Proceedings in Theoretical Computer Science  
Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security.  ...  They are essential in characterizing the behaviour of many critical systems and in estimating their properties.  ...  In the probabilistic setting, the amount of information leakage is determined in terms of the probability of observing a security violation and, in the case the system execution is (partially) under the  ... 
doi:10.4204/eptcs.312.1 fatcat:4fjvygbppjbq3k5ury2kvue3nq

Table of Contents

2020 IEEE Transactions on Automatic Control  
Perruquetti 5429 Control of Nondeterministic Systems for Bisimulation Equivalence Under Partial Information . . . . . . . . . . . . . . . H.  ...  Farhat 5437 Equivalence-Based Model of Dimension-Varying Linear Systems . . . . . . . . . . . . . . . . . . . . . . . D. Cheng, Z. Xu, and T.  ... 
doi:10.1109/tac.2020.3032246 fatcat:53ud3j7ysfg7pboxxpepokwn2q

On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems [chapter]

Ievgen Ivanov
2016 Lecture Notes in Computer Science  
for abstracting continuous-time linear control systems [16] , etc.  ...  However, comparing various definitions of bisimulation for continuous-time dynamical/control/hybrid systems to the definition of a bisimulation on the states of a LTS, an important aspect of these definitions  ... 
doi:10.1007/978-3-319-40370-0_13 fatcat:g65a6trgv5cslajm3ovctmj72m

On the computational complexity of bisimulation, redux

Faron Moller, Scott Smolka, Jiří Srba
2004 Information and Computation  
The authors believe that the special issue of Information and Computation devoted to PCK50: Principles of Computing and Knowledge: Paris C.  ...  Smolka and Moller have also written a brief survey about the computational complexity of bisimulation [ACM Comput. Surv. 27(2) (1995) 287].  ...  It is well-known that bisimulations are closed under union and that the largest bisimulation, under set inclusion, exists.  ... 
doi:10.1016/j.ic.2004.06.003 fatcat:5qdd4c7m6bayfkgxvh6extoiza
« Previous Showing results 1 — 15 out of 1,186 results