Complexity analysis of continuous Petri nets

DOI10.3233/FI-2015-1168zbMATH Open1335.68169OpenAlexW2167776377MaRDI QIDQ2805416FDOQ2805416

Authors: Estíbaliz Fraca, Serge Haddad 

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1168

Recommendations

• Complexity analysis of continuous Petri nets
• Continuous Petri Nets: Expressive Power and Decidability Issues
• The logical view on continuous Petri nets
• Continuous Petri nets: expressive power and decidability issues
• Asymptotic continuous Petri nets

zbMATH Keywords

complexitystructural analysiscontinuous Petri nets

Mathematics Subject Classification ID

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

Cited In (28)

• Continuous Petri Nets: Expressive Power and Decidability Issues
• Discrete parameters in Petri nets
• Separators in Continuous Petri Nets
• Finding cut-offs in leaderless rendez-vous protocols is easy
• Directed reachability for infinite-state systems
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Title not available (Why is that?)
• Context-free commutative grammars with integer counters and resets
• Complexity results for problems of communication-free Petri nets and related formalisms
• Checking system boundedness using ordinary differential equations
• Individuals, populations and fluid approximations: a Petri net based perspective
• Separators in continuous Petri nets
• \(\omega\)-Petri nets: algorithms and complexity
• Asymptotic continuous Petri nets
• Applications and Theory of Petri Nets 2005
• Logics for continuous reachability in Petri nets and vector addition systems with states
• Title not available (Why is that?)
• The logical view on continuous Petri nets
• Complexity analysis of continuous Petri nets
• Continuous Petri nets: expressive power and decidability issues
• Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
• Decidability and complexity of action-based temporal planning over dense time
• Title not available (Why is that?)
• Membrane Computing
• Linear equations with ordered data
• Fast termination and workflow nets
• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• Population protocols: beyond runtime analysis

This page was built for publication: Complexity analysis of continuous Petri nets

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