Compositional non-blockingness verification of finite automata with prioritised events

DOI10.1007/S10626-024-00394-2zbMATH Open1537.93486WikidataQ129350375 ScholiaQ129350375MaRDI QIDQ6544792FDOQ6544792

Thomas Moor, Yiheng Tang

Publication date: 27 May 2024

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

zbMATH Keywords

compositional verificationdiscrete-event systemsmodular systemsevent priorities

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)

Cites Work

• Title not available (Why is that?)
• A framework for compositional nonblocking verification of extended finite-state machines
• Compositional Verification in Supervisory Control
• Title not available (Why is that?)
• Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
• Priority and abstraction in process algebra
• Introduction to Discrete Event Systems
• Supervisory Control of a Class of Discrete Event Processes
• Conflict-preserving abstraction of discrete event systems using annotated automata
• Multitasking supervisory control of discrete-event systems
• Automated Technology for Verification and Analysis
• On the computation of counterexamples in compositional nonblocking verification

This page was built for publication: Compositional non-blockingness verification of finite automata with prioritised events

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544792)