Applications and Theory of Petri Nets 2004

DOI10.1007/b98283zbMath1094.68067OpenAlexW2495597431WikidataQ56892631 ScholiaQ56892631MaRDI QIDQ5712359

Agata Półrola, Wojciech Penczek

Publication date: 23 December 2005

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

Full work available at URL: https://doi.org/10.1007/b98283

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A counter abstraction technique for verifying properties of probabilistic swarm systems, CTL* model checking for time Petri nets, Model checking of time Petri nets using the state class timed automaton, Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs, Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs, A menagerie of timed automata, Covering Steps Graphs of Time Petri Nets

Uses Software

• CPN/Tools
• Kronos
• Design/CPN
• TINA
• Chaff