Sciweavers

656 search results - page 25 / 132
» A Formalization of Transition P Systems
Sort
View
82
Voted
ICALP
1989
Springer
15 years 4 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano
102
Voted
RTSS
1998
IEEE
15 years 4 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
128
Voted
APSEC
2001
IEEE
15 years 4 months ago
Formal Specification of Mixed Components with Korrigan
Formal specifications are now widely accepted in software development. Recently, the need for a separation of concerns with reference to static and dynamic aspects appeared. Furth...
Christine Choppy, Pascal Poizat, Jean-Claude Royer
91
Voted
FUIN
2010
103views more  FUIN 2010»
14 years 11 months ago
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
A formal model for diagnostics of biological systems modelled as P systems is presented. We assume the presence of some biologically motivated changes (frequently pathological) in ...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
82
Voted
IFL
2004
Springer
15 years 6 months ago
The Feasibility of Interactively Probing Quiescent Properties of GUI Applications
In this paper we explore how application-users can, in an interactive way, test properties about the state of GUI applications that can be classified as local state transition sys...
Peter Achten