scientific article; zbMATH DE number 5587274

zbMATH Open1194.68161MaRDI QIDQ5190782

Maciej Koutny, Jetty Kleijn

Publication date: 27 July 2009

Title of this publication is not available (Why is that?)

zbMATH Keywords

boundednessreachabilityPetri netsdecidabilitystep coverability treestep semanticsinhibitor arcs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Step coverability algorithms for communicating systems

Recommendations

• Step coverability algorithms for communicating systems 👍 👎
• Networks and chain coverings in partial orders and their products 👍 👎
• Step semantics of Boolean nets 👍 👎
• Synthesis and Analysis of Net Structures and Transition Graphs with Inhibitor Relations 👍 👎
• Covering Steps Graphs of Time Petri Nets 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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