Equivalence checking of Petri net models of programs using static and dynamic cut-points

DOI10.1007/s00236-018-0320-2zbMath1430.68159OpenAlexW2800044382WikidataQ129973371 ScholiaQ129973371MaRDI QIDQ2415374

Dipankar Sarkar, Chittaranjan Mandal, Soumyadip Bandyopadhyay

Publication date: 21 May 2019

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-018-0320-2

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Translation validation of coloured Petri net models of programs on integers

Uses Software

• PLuTo
• GitHub
• SamaTulyata
• v2c
• PIPS
• Flamel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deriving bisimulation relations from path based equivalence checkers
• Hardness of equivalence checking for composed finite-state systems
• Verification of Petri Nets with Read Arcs
• Validating High-Level Synthesis
• Coloured Petri Nets
• Program correctness: on inductive assertion methods
• An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
• A Path Construction Algorithm for Translation Validation Using PRES+ Models
• Verifying Parallel Algorithms and Programs Using Coloured Petri Nets
• Embedded System Design

This page was built for publication: Equivalence checking of Petri net models of programs using static and dynamic cut-points