Sciweavers

656 search results - page 39 / 132
» A Formalization of Transition P Systems
Sort
View
117
Voted
FORMATS
2010
Springer
14 years 10 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan
103
Voted
ICCS
2000
Springer
15 years 4 months ago
Conceptual Knowledge Discovery and Data Analysis
In this paper, we discuss Conceptual Knowledge Discovery in Databases (CKDD) in its connection with Data Analysis. Our approach is based on Formal Concept Analysis, a mathematical ...
Joachim Hereth Correia, Gerd Stumme, Rudolf Wille,...
INFORMATICALT
2008
93views more  INFORMATICALT 2008»
15 years 18 days ago
Viewcharts: Syntax and Semantics
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components....
Ayaz Isazadeh, Jaber Karimpour
87
Voted
ENTCS
2007
123views more  ENTCS 2007»
15 years 17 days ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
15 years 2 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...