Sciweavers

97 search results - page 16 / 20
» Petri Nets with Simple Circuits
Sort
View
JCIT
2008
94views more  JCIT 2008»
13 years 7 months ago
Finding Semantic Errors in the Rule-base of Production Systems, and Reasoning with Insufficient Input Data Petri-net-based Appro
Two simple but practical production systems are modeled using Petri Nets. Petri-net models are very useful in finding semantic errors like generalization error and missing conditi...
Hong-Youl Lee
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 11 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
ICALP
2009
Springer
14 years 7 months ago
Forward Analysis for WSTS, Part II: Complete WSTS
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
Alain Finkel, Jean Goubault-Larrecq
WEBI
2005
Springer
14 years 29 days ago
IPR: Automated Interaction Process Reconciliation
Inter-organizational business processes usually require complex and time-consuming interactions between partners than simple interactions supported by WSDL. Automated reconciliati...
Zongxia Du, Jinpeng Huai, Yunhao Liu, Chunming Hu,...
FOSSACS
2000
Springer
13 years 11 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin