Sciweavers

41 search results - page 5 / 9
» Automata and Logics for Timed Message Sequence Charts
Sort
View
FORMATS
2007
Springer
14 years 2 months ago
Counter-Free Input-Determined Timed Automata
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabha...
ETFA
2008
IEEE
14 years 2 months ago
Evaluation of Sequential Function Charts execution techniques. The Active Steps Algorithm
Programmable Logic Controllers (PLCs) play a significant role in the control of production systems and Sequential Function Chart (SFC) is one of the main programming languages. Th...
Ramon Piedrafita Moreno, José Luis Villarro...
24
Voted
FORTE
1994
13 years 9 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue
AAI
2010
94views more  AAI 2010»
13 years 2 months ago
Sequence-Indexed Linear-Time Temporal Logic: Proof System and Application
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Ken Kaneiwa, Norihiro Kamide
CONCUR
2004
Springer
14 years 1 months ago
The Pros and Cons of Netcharts
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
Nicolas Baudru, Rémi Morin