On the computation of counterexamples in compositional nonblocking verification

DOI10.1007/S10626-019-00305-WzbMath1448.93205OpenAlexW3008321852WikidataQ124844030 ScholiaQ124844030MaRDI QIDQ2197583

Robi Malik, Simon Ware

Publication date: 1 September 2020

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

Full work available at URL: https://hdl.handle.net/10289/13637

zbMATH Keywords

model checkingdiscrete event systemscompositional verificationnonblocking

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Computational methods for problems pertaining to systems and control theory (93-08)

Related Items (1)

A survey on compositional algorithms for verification and synthesis in supervisory control

Uses Software

• UMDES
• Supremica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conflict-preserving abstraction of discrete event systems using annotated automata
• Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
• Testing equivalences for processes
• Introduction to Discrete Event Systems
• Compositional Verification in Supervisory Control
• Compositionality in state space verification methods
• Logic in Computer Science
• Verification of Nonconflict of Supervisors Using Abstractions
• COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA
• Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions
• CONFLICTS AND FAIR TESTING

This page was built for publication: On the computation of counterexamples in compositional nonblocking verification