scientific article; zbMATH DE number 2112982

zbMATH Open1082.68074MaRDI QIDQ4824481FDOQ4824481

Authors: Victor Khomenko, Maciej Koutny, Alex Yakovlev 

Publication date: 1 November 2004

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

Recommendations

• scientific article; zbMATH DE number 5042671
• On the complexity of consistency and complete state coding for signal transition graphs
• Component refinement and CSC-solving for STG decomposition
• scientific article; zbMATH DE number 2112981
• Foundations of Software Science and Computational Structures

zbMATH Keywords

Petri netsasynchronous circuitsautomated synthesis

Mathematics Subject Classification ID

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

Cited In (8)

• Resolution of encoding conflicts by signal insertion and concurrency reduction based on STG unfoldings
• Title not available (Why is that?)
• On the complexity of consistency and complete state coding for signal transition graphs
• Merged processes: a new condensed representation of Petri net behaviour
• STG decomposition strategies in combination with unfolding
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• Generation of synchronizing state machines from a transition system: a region-based approach
• Avoiding irreducible CSC conflicts by internal communication

Uses Software

• Chaff
• Petrify

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 Q4824481)