Skip to content
Channels - Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Search for more channels:
Similar Items: Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Channel Options
View Record
Explore related channels
Quick Look
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Quick Look
A Truly Concurrent Semantics for Reversible CCS
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
Finitary Truly Concurrent Bisimulations
Quick Look
A Reduced Semantics for Deciding Trace Equivalence
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
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
Quick Look
Bounded Reachability Problems are Decidable in FIFO Machines
Quick Look
Synchronizability of Communicating Finite State Machines is not Decidable
Quick Look
Petri Automata
Quick Look
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
Quick Look
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
Quick Look
On the decidability and complexity of Metric Temporal Logic over finite words
Quick Look
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy
Quick Look
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
Quick Look
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Load more items
View Record
Prev
Explore related channels
Next