Skip to content
Channels - Petri Automata :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Petri Automata
Search for more channels:
Similar Items: Petri Automata
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
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
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
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
Quick Look
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Quick Look
Modal Interface Automata
Quick Look
Stochastic Timed Automata
Quick Look
Logic and Branching Automata
Quick Look
History-Register Automata
Quick Look
Inferring Symbolic Automata
Quick Look
Minimisation of Multiplicity Tree Automata
Quick Look
Data optimizations for constraint automata
Quick Look
Edit Distance for Pushdown Automata
Quick Look
Sampled Semantics of Timed Automata
Load more items
View Record
Prev
Explore related channels
Next