An Improvement of McMillan's Unfolding Algorithm
Authors:
Top Cited Papers
- 1 May 2002
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 20 (3) , 285-310
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An improvement of McMillan's unfolding algorithm1996
- Trace theoretic verification of asynchronous circuits using unfoldings1995
- A technique of state space search based on unfoldingFormal Methods in System Design, 1995
- Model checking using net unfoldingsScience of Computer Programming, 1994
- Petri net analysis using boolean manipulationLecture Notes in Computer Science, 1994
- Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits1993
- Branching processes of Petri netsActa Informatica, 1991
- Combinatorics on Traces1990
- Petri Nets1988
- Petri nets, event structures and domains, part ITheoretical Computer Science, 1981