scientific article

zbMath0633.68052MaRDI QIDQ3771630

Alain Finkel

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Petri netstransition systemseffective algorithmscoverability treecommunicating finite automataFifo nets

Mathematics Subject Classification ID

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

Related Items (15)

Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reduction and covering of infinite reachability trees ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning ⋮ Testing for unboundedness of fifo channels ⋮ A well-structured framework for analysing Petri net extensions ⋮ Well-structured transition systems everywhere! ⋮ Parameterized verification of monotone information systems ⋮ Unnamed Item ⋮ Forward analysis for WSTS, part I: completions ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems ⋮ Complexity Hierarchies beyond Elementary ⋮ Unnamed Item

This page was built for publication: