Combining free choice and time in Petri nets

DOI10.1016/j.jlamp.2018.11.006zbMath1451.68190OpenAlexW2901642814WikidataQ128887617 ScholiaQ128887617MaRDI QIDQ2291812

S. Akshay, Loïc Hélouët, Ramchandra Phawade

Publication date: 31 January 2020

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01931728/file/Lamp.pdf

zbMATH Keywords

robustnessPetri netsfree-choice

Mathematics Subject Classification ID

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

Related Items (2)

Waiting nets ⋮ Waiting Nets: State Classes and Taxonomy

Uses Software

• TAPAAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model checking of time Petri nets using the state class timed automaton
• Branching processes of Petri nets
• Complexity of some problems in Petri nets
• The covering and boundedness problems for vector addition systems
• Time-based expressivity of time Petri nets for system specification
• A theory of timed automata
• A technique of state space search based on unfolding
• A causal semantic for time Petri nets
• A well-structured framework for analysing Petri net extensions
• Dynamical properties of timed automata
• Decidable Classes of Unbounded Petri Nets with Time and Urgency
• Back in Time Petri Nets
• Robustness of Time Petri Nets under Guard Enlargement
• Verification of Timed-Arc Petri Nets
• Robust Model-Checking of Timed Automata via Pumping in Channel Machines
• Weak Time Petri Nets Strike Back!
• The non-sequential behaviour of Petri nets
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• Free Choice Petri Nets
• Reachability of Communicating Timed Processes
• Branching Processes of General Petri Nets
• Timed processes of Timed Petri Nets
• On Multi-enabledness in Time Petri Nets

This page was built for publication: Combining free choice and time in Petri nets