Complexity analysis of continuous Petri nets

DOI10.3233/FI-2015-1168MaRDI QIDQ2805416zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexitycontinuous Petri netsstructural analysis

Mathematics Subject Classification ID

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

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

Cited in

(32)

• Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
• Asymptotic continuous Petri nets
• Decidability and complexity of action-based temporal planning over dense time
• Finding cut-offs in leaderless rendez-vous protocols is easy
• Directed reachability for infinite-state systems
• Context-free commutative grammars with integer counters and resets
• Population protocols: beyond runtime analysis
• -Petri nets: algorithms and complexity
• Complexity results for problems of communication-free Petri nets and related formalisms
• Discrete parameters in Petri nets
• Individuals, populations and fluid approximations: a Petri net based perspective
• Continuous Petri Nets: Expressive Power and Decidability Issues
• Continuous Petri nets: expressive power and decidability issues
• scientific article; zbMATH DE number 4024806 (Why is no real title available?)
• scientific article; zbMATH DE number 1973130 (Why is no real title available?)
• Checking system boundedness using ordinary differential equations
• Linear equations with ordered data
• Logics for continuous reachability in Petri nets and vector addition systems with states
• scientific article; zbMATH DE number 7407775 (Why is no real title available?)
• Complexity analysis of continuous Petri nets
• The logical view on continuous Petri nets
• Applications and Theory of Petri Nets 2005
• Membrane Computing
• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• Separators in Continuous Petri Nets
• Separators in continuous Petri nets
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Fast termination and workflow nets
• The complexity of linear temporal verification for continuous counter systems
• Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
• Monus semantics in vector addition systems with states
• Continuous Petri nets faithfully fluidify most permissive Boolean networks

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)