The Complexity of Diagnosability and Opacity Verification for Petri Nets-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Published:2018-07-06 Issue:4 Volume:161 Page:317-349
ISSN:0169-2968
Container-title:Fundamenta Informaticae
language:
Short-container-title:FI

Author:

Bérard Béatrice¹,Haar Stefan²,Schmitz Sylvain³,Schwoon Stefan⁴

Affiliation:

1. Sorbonne Universités, UPMC Univ. Paris 06, LIP6, CNRS, Paris, France. beatrice.berard@lip6.fr

2. INRIA and LSV, ENS Paris-Saclay and CNRS, Université Paris-Saclay, France. stefan.haar@inria.fr

3. LSV, ENS Paris-Saclay and CNRS, Université Paris-Saclay, France. schmitz@lsv.fr

4. LSV, ENS Paris-Saclay and CNRS, Université Paris-Saclay, and INRIA, France. schwoon@lsv.fr

Publisher

IOS Press

Subject

Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Diagnosability of labeled Dp-automata;Theoretical Computer Science;2024-11

2. State-based opacity of labeled real-time automata;Theoretical Computer Science;2024-03

3. A novel approach for fault diagnosis using partial observations of actions and atomic propositions;IFAC-PapersOnLine;2024

4. A unified concurrent-composition method to state/event inference and concealment in labeled finite-state automata as discrete-event systems;Annual Reviews in Control;2023

5. Online verification of K-step opacity by Petri nets in centralized and decentralized structures;Automatica;2022-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP