Sciweavers

311 search results - page 2 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
UML
2001
Springer
13 years 9 months ago
Representing Embedded System Sequence Diagrams as a Formal Language
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
Elizabeth Latronico, Philip Koopman
CONCUR
2007
Springer
13 years 11 months ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
IFIP
2010
Springer
13 years 5 days ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
ITICSE
2005
ACM
13 years 11 months ago
A prolog toolkit for formal languages and automata
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...
Michel Wermelinger, Artur Miguel Dias
EMSOFT
2004
Springer
13 years 10 months ago
A model-based approach to integrating security policies for embedded devices
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
Michael McDougall, Rajeev Alur, Carl A. Gunter