Comparing Semantics Under Strong Timing of Petri Nets

DOI10.1007/978-3-662-46823-4_30MaRDI QIDQ3455089zbMATH OpenOpenAlexFDO

Authors I. B. Virbitskaite, Dmitry Bushin

Publication date 3 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46823-4_30

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated Technology for Verification and Analysis
• Comparative trace semantics of time Petri nets
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
• Formal Modeling and Analysis of Timed Systems
• scientific article; zbMATH DE number 4143457
• scientific article; zbMATH DE number 1534580
• Timing constraint Petri nets and their schedulability analysis and verification
• Timing constraint Petri nets and their schedulability analysis and verification
• scientific article; zbMATH DE number 3974312
• Testing equivalences of time Petri nets

Cites work

• Formal Methods for the Design of Real-Time Systems
• Formal Modeling and Analysis of Timed Systems
• Time processes for time Petri nets
• Timed processes of timed Petri nets

Cited in

(4)

• True concurrent equivalences in time Petri nets
• Comparative trace semantics of time Petri nets
• Formal Modeling and Analysis of Timed Systems
• scientific article; zbMATH DE number 4119656 (Why is no real title available?)

This page was built for publication: Comparing Semantics Under Strong Timing of Petri Nets

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