FSKD
2011
Springer
12 years 11 months ago
2011
Springer
—With the wide utilization of Petri nets, many researchers suggest that Petri nets should be reused and shared. Emerging the Semantic Web technologies, such as ontologies, can pl...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
TCS
2011
13 years 6 months ago
2011
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
JCSS
2011
13 years 6 months ago
2011
It is widely recognised that software development is a complex process. Among the factors that contribute to its inherent complexity is the gap between the design and the formal a...
INFORMATICALT
2010
13 years 8 months ago
2010
This paper analyses the possibilities of integrating different technological and knowledge representation techniques for the development of a framework for the remote control of mu...
ICSEA
2009
IEEE
13 years 9 months ago
2009
IEEE
A scenario can be used to describe a possible instantiation of a given business use case and can be expressed for example as a list of steps written in natural language, or by an ...
ICINCO
2009
13 years 9 months ago
2009
This paper serves as a support for the plenary address given by the second author during the conference. In this paper we present an approach to on-line diagnosis of discrete even...
ENASE
2009
13 years 9 months ago
2009
Abstract. The design of dynamic discrete-event systems calls for adequate modeling formalisms and tools to manage possible changes occurring during system's lifecycle. A commo...
MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
LATA
2010
Springer
13 years 10 months ago
2010
Springer
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...