Symbolic execution of concurrent systems using Petri nets

DOI10.1016/0096-0551(89)90023-4MaRDI QIDQ3031902zbMATH OpenOpenAlexFDO

Authors Carlo Ghezzi, Dino Mandrioli, Sandro Morasca, Mauro Pezzè

Publication date 1989

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(89)90023-4

zbMATH Keywords

concurrent systemsPetri netssoftware analysissymbolic executiontesting

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Symbolic computation and algebraic computation (68W30)

Recommendations

• Verifying Concurrent Systems with Symbolic Execution
• Petri net analysis using invariant generation
• Concurrency, Synchronization, and Conflicts in Petri Nets
• scientific article; zbMATH DE number 1796141
• Verifying concurrent systems with symbolic execution. Temporal reasoning is symbolic execution with a little induction.

Cited in

(5)

• Verifying Concurrent Systems with Symbolic Execution
• scientific article; zbMATH DE number 4213468 (Why is no real title available?)
• Interactive verification of concurrent systems using symbolic execution
• Symbolic execution of Reo circuits using constraint automata
• Timed Petri nets and temporal linear logic

This page was built for publication: Symbolic execution of concurrent systems using Petri nets

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