scientific article
From MaRDI portal
Publication:3802633
zbMath0655.68072MaRDI QIDQ3802633
Rodney R. Howell, Hsu-Chun Yen, Louis E. Rosier
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Problems concerning fairness and temporal logic for conflict-free Petri nets ⋮ Decidability of weak fairness in petri nets ⋮ Decidability of a temporal logic problem for Petri nets ⋮ Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems ⋮ Communicating processes, scheduling, and the complexity of nontermination ⋮ Global and local views of state fairness
This page was built for publication:
