A theory of implementation and refinement in timed Petri nets

DOI10.1016/S0304-3975(97)00078-9zbMath0902.68137OpenAlexW2126134153MaRDI QIDQ1128980

Miguel Felder, Angelo Morzenti, Angelo Gargantini

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00078-9

zbMATH Keywords

verificationdesigncorrectnessrequirementstemporal logicimplementationrefinementspecificationtimed Petri netsreal-time and reactive systems

Mathematics Subject Classification ID

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

Cites Work

• Modular construction and partial order semantics of Petri nets
• The existence of refinement mappings
• Using mappings to prove timing properties
• Analysis of Petri nets by stepwise refinements
• Ten Years of Hoare's Logic: A Survey—Part I
• Constraint logic programming for reasoning about discrete event processes
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A theory of implementation and refinement in timed Petri nets