Litcius/Paper detail

Verification of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e290" altimg="si6.svg"> <mml:mi>K</mml:mi> </mml:math> -step and infinite-step opacity of bounded labeled Petri nets

Yin Tong, Hao Lan, Carla Seatzu

2022Automatica23 citationsDOIOpen Access PDF

Topics & Concepts

ReachabilityOpacityAlgorithmGraphBounded functionComputer scienceDiscrete mathematicsTheoretical computer scienceProperty (philosophy)MathematicsMathematical analysisPhysicsOpticsEpistemologyPhilosophyPetri Nets in System ModelingDistributed systems and fault toleranceSecurity and Verification in Computing
Verification of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e290" altimg="si6.svg"> <mml:mi>K</mml:mi> </mml:math> -step and infinite-step opacity of bounded labeled Petri nets | Litcius