scientific article; zbMATH DE number 2134685

MaRDI QIDQ3159773zbMATH OpenFDO

Authors Shingo Yamaguchi, Kousuke Yamada, Minoru Tanaka, Qi-Wei Ge

Publication date 16 February 2005

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2064230
• Reachability, confluence, and termination analysis with state-compatible automata
• Reachability for finite-state process algebras using static analysis
• State space analysis of Petri nets with relation-algebraic methods
• Approximate Symbolic Reachability of Networks of Transition Systems
• Reachability Analysis with State-Compatible Automata
• Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
• scientific article; zbMATH DE number 2088669
• Generalized state equation for Petri nets
• Analysis of networks with ideal switches by state equations

Cited in

(1)

• A method of computing minimum firing time for self-cleaning SWITCH-less program nets

Describes a project that uses

Uses Software

• SWITCH

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159773)