Skip to content
<title>Channels - Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
Search for more channels:
Similar Items: Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
Channel Options
View Record
Explore related channels
Quick Look
Priced Timed Petri Nets
Quick Look
Structurally Cyclic Petri Nets
Quick Look
Separators in Continuous Petri Nets
Quick Look
Event Structures for Petri nets with Persistence
Quick Look
Applying CEGAR to the Petri Net State Equation
Quick Look
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
Quick Look
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
Quick Look
On the Home-Space Problem for Petri Nets and its Ackermannian Complexity
Quick Look
Relating Reversible Petri Nets and Reversible Event Structures, categorically
Quick Look
Coarse abstractions make Zeno behaviours difficult to detect
Quick Look
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Quick Look
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
Quick Look
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Quick Look
Petri Automata
Quick Look
Decidability Results for the Boundedness Problem
Quick Look
Sub-computable Boundedness Randomness
Quick Look
Boundedness in languages of infinite words
Quick Look
Hybrid DenseNet Architectures and KerasTuner-Based Optimization for Rice Leaf Disease Detection
Quick Look
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Quick Look
Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion
Quick Look
Real-Time Model-Checking: Parameters everywhere
Quick Look
Model Checking One-clock Priced Timed Automata
Quick Look
Timed Automata Robustness Analysis via Model Checking
Quick Look
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Load more items
View Record
Prev
Explore related channels
Next
