Reduction and covering of infinite reachability trees

DOI10.1016/0890-5401(90)90009-7zbMath0753.68073OpenAlexW1965726041MaRDI QIDQ1173681

Alain Finkel

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90009-7

zbMATH Keywords

Petri netstransition systemsdecidable problems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items

Forward analysis and model checking for trace bounded WSTS, Branch-well-structured transition systems and extensions, On selective unboundedness of VASS, Handling infinitely branching well-structured transition systems, Well-abstracted transition systems: Application to FIFO automata., Deciding safety properties in infinite-state pi-calculus via behavioural types, Unnamed Item, Forward Analysis and Model Checking for Trace Bounded WSTS, Unnamed Item, A well-structured framework for analysing Petri net extensions, On the \(\omega\)-language expressive power of extended Petri nets, Well-structured transition systems everywhere!, Ensuring completeness of symbolic verification methods for infinite-state systems, Unnamed Item, Forward analysis for WSTS, part I: completions, Commodification of accelerations for the Karp and Miller construction, How to Tackle Integer Weighted Automata Positivity, Unnamed Item, Verification of programs with half-duplex communication, Model checking of systems with many identical timed processes, Algorithmic analysis of programs with well quasi-ordered domains., Expand, enlarge and check: new algorithms for the coverability problem of WSTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Coloured Petri nets and the invariant-method
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• Homomorphisms between models of parallel computation
• Parallel program schemata
• The theory of well-quasi-ordering: a frequently discovered concept
• On Communicating Finite-State Machines
• An Algorithm for the General Petri Net Reachability Problem
• Formal verification of parallel programs
• Ordering by Divisibility in Abstract Algebras