A reduced maximality labeled transition system generation for recursive Petri nets

DOI10.1007/S00165-015-0341-3zbMath1347.68256OpenAlexW1175596776MaRDI QIDQ903505

Messaouda Bouneb, Djamel Eddine Saidouni, Jean-Michel Ilié

Publication date: 6 January 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-015-0341-3

zbMATH Keywords

maximality bisimulationmaximality labeled transition systemsrecursive Petri nets

Mathematics Subject Classification ID

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

Cites Work

• Bisimulation and action refinement
• Refinement of actions in event structures and causal trees
• Concurrency and atomicity
• Maximality preserving bisimulation
• Testing equivalence as a bisimulation equivalence
• Concurrent bisimulations in Petri nets
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduced maximality labeled transition system generation for recursive Petri nets