Filters








370,131 Hits in 7.0 sec

An Abstract State Machine (ASM) Representation of Learning Process in FLOSS Communities [chapter]

Patrick Mukala, Antonio Cerone, Franco Turini
2015 Lecture Notes in Computer Science  
In this paper, we describe the adoption of Abstract States Machines (ASMs) as a specification methodology for the description of learning processes in FLOSS.  ...  Free/Libre Open Source Software (FLOSS) communities as collaborative environments enable the occurrence of learning between participants in these groups.  ...  Abstract State Machines (ASMs): Motivation ASMs [14, 15, 16, 17, 18] can be understood as extensions of FSM (Finite State Machines) where any desired level of abstraction can be achieved by permitting  ... 
doi:10.1007/978-3-319-15201-1_15 fatcat:bpehcax2efckjobyxowdfvtkum

Abstractions, composition and reasoning

Ella E. Roubtsova, Ashley T. McNeile
2009 Proceedings of the 13th workshop on Aspect-oriented modeling - AOM '09  
basis for identifying abstractions at the Platform Independent level of modelling.  ...  We propose that different process algebraic composition techniques, combined with consideration of the restrictions on the ability of different parts of a system to share data and state, can provide a  ...  A Protocol Machine behaves as follows. • Event handling. -A Protocol Machine can only engage in an action when in a quiescent state.  ... 
doi:10.1145/1509297.1509303 fatcat:4vudlss7srevdbia7isquet4na

Modelling and Refinement in CODA

Michael Butler, John Colley, Andrew Edmunds, Colin Snook, Neil Evans, Neil Grant, Helen Marshall
2013 Electronic Proceedings in Theoretical Computer Science  
Component behaviour is specified through a combination of UML-B state machines and Event-B. CODA communications and timing are given an Event-B semantics through translation rules.  ...  CODA is an extension of Event-B and UML-B and is supported by a plug-in for the Rodin toolset.  ...  Even though the facility for delayed communication was already in place, it was difficult for the user to introduce this communication at the state machine level.  ... 
doi:10.4204/eptcs.115.3 fatcat:cjnifqk2cnbopdqsar4ttsibwm

Reducing Software Architecture Models Complexity: A Slicing and Abstraction Approach [chapter]

Daniela Colangelo, Daniele Compare, Paola Inverardi, Patrizio Pelliccione
2006 Lecture Notes in Computer Science  
In this paper we propose an approach that slices and abstracts the SA of a system in order to reduce the model complexity without compromising the verification validity.  ...  It is applied to an industrial telecommunication system of the Selex Communications company.  ...  Acknowledgements This work is partially supported by the PLASTIC project: Providing Lightweight and Adaptable Service Technology for pervasive Information and Communication.  ... 
doi:10.1007/11888116_19 fatcat:z6tnelr6xnhmhev3trsnlymkw4

A Process Algebraic Approach to Decomposition of Communicating SysML Blocks

Jaco Jacobs, Andrew Andrew Simpson
2013 International Journal of Modeling and Optimization  
In a top-down systems engineering approach, an abstract block is decomposed into concrete communicating sub-blocks.  ...  We introduce a small case study in order to validate the approach.  ...  The blocks communicate via events that act as stimuli for the associated state machines, causing the transitions to fire and resulting in a change of state.  ... 
doi:10.7763/ijmo.2013.v3.257 fatcat:ezlr4uuoo5fmfgaapdzk2lkpmm

Kit: a study in operating system verification

W.R. Bevier
1989 IEEE Transactions on Software Engineering  
of the abstract kernel and a proof that GOOD-AK is an invariant of the abstract kernel, • the definition of the kernel, and a proof that the kernel always leaves a target machine in a GOOD-OS state, •  ...  The Abstract Kernel Implements Processes The relationship between the abstract kernel and an individual task is pictured in Figure 4 The Target Machine The target machine TM is a simple von Neumann  ...  AK is abstract in the following ways. • The private state spaces of tasks are transparently isolated.  ... 
doi:10.1109/32.41331 fatcat:sumcri2ukvazxgdyccrcbd56la

Towards Machine Mind Evolution

Ján Kollár, Michal Sičák, Milan Spišiak
2015 Proceedings of the 2015 Federated Conference on Computer Science and Information Systems  
We present process of higher order regular abstraction and state automata acceptance as possible machine reality realization mechanism.  ...  We show that non-redundancy of a machine language is the decisive criterion for restructuring the machine mind language in each moment of communication.  ...  Clearly, machines should be active in communication, i.e. able to formulate the questions.  ... 
doi:10.15439/2015f210 dblp:conf/fedcsis/KollarSS15 fatcat:fv3ihudldfdddcykyzvrckqymm

Implementing Services by Partial State Machines [chapter]

Walter Dosch, Annette Stümpel
2009 Lecture Notes in Computer Science  
The predicates in the precondition document the readiness set of the server.  ...  function partial state machine Introduction Stream Processing Partial State Machines Construction Application Conclusion Streams Streams model communication histories on undirectional FIFO  ...  Partial State Machines (Minimal) partial state machine for the bounded stack service M = (Data ≤n , In, Data, Ready , next, out, ) In, Out, Ready , next, out, ∅)Transition table for the state  ... 
doi:10.1007/978-3-540-95891-8_24 fatcat:7g4tisz65ndydljizlbbqpttty

Domain Specific Analysis of Statemachine Models of Reactive Systems

Karolina Zurowska
2013 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
This removes the translational effort and, in addition, enables the use of MDD-specific abstractions aiming to support better understanding of models and to improve the scalability of verification.  ...  We will define abstractions for data (using symbolic execution), for structure and for behavior.  ...  This type of abstraction aggregates states of a state machine by combining them into one state, for instance to deal with hierarchical states in state machines.  ... 
dblp:conf/models/Zurowska13 fatcat:cuey5cs7ujhr3csqhnhcirmac4

What is an algorithm?

Moshe Y. Vardi
2012 Communications of the ACM  
Gurevich argued that every algorithm can be defined in terms of an abstract state machine.  ...  So is an algorithm an abstract state machine or a recursor?  ... 
doi:10.1145/2093548.2093549 fatcat:ewj7pxrhzjbpnavxqwnepdqvlq

Pict Correctness Revisited [chapter]

Philippe Bidinger, Adriana Compagnoni
2007 Lecture Notes in Computer Science  
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine.  ...  We also give new proofs of soundness and liveness for the Pict abstract machine.  ...  The first property follows the idea that the initial state of an abstract machine executing [[P ]] is P .  ... 
doi:10.1007/978-3-540-72952-5_13 fatcat:aslci3catzfidbmqljs7yckgyy

An Abstract Model for Service Compositions Based on Agents [chapter]

Jinkui Xie, Linpeng Huang
2005 Lecture Notes in Computer Science  
The model is based on distributed Abstract State Machine and tallies with Universal Plug and Play (UPnP) architecture standard.  ...  In the abstract model, the composition of services can be viewed as a union of agents.  ...  Abstract State Machines We first define the notion of Abstract State Machines. For more details, we refer to the Lipari-Guide [4] and the ASM 1997 Guide [5] .  ... 
doi:10.1007/11428862_165 fatcat:7tmlhgqiojbk7epeq5hux7d6ui

Abstract Communication Model for Distributed Systems

U. Glasser, Y. Gurevich, M. Veanes
2004 IEEE Transactions on Software Engineering  
The model is based on distributed abstract state machines. It is implemented in the specification language AsmL and is used for testing distributed systems.  ...  Index Terms-Abstract state machines, communication protocols, computer networks, distributed systems, requirement specification, system modeling, testing of distributed systems. ae INTRODUCTION A couple  ...  Abstract state machines simulate arbitrary algorithms in the step-for-step manner.  ... 
doi:10.1109/tse.2004.25 fatcat:qiqzx5rm5za4lfrsu532ovdcwy

Algebraic State Machines: Concepts and Applications to Security [chapter]

Jan Jürjens
2004 Lecture Notes in Computer Science  
Needed: formalism that supports • abstraction (to scale to realistic systems) • asynchronous communication (as in UML) • algebraic reasoning (for cryptography) Algebraic State Machines (AlgSMs) Proposed  ...  by Broy, Wirsing based on Abstract State Machines (Gurevich).  ... 
doi:10.1007/978-3-540-39866-0_33 fatcat:x5rk4ftgcze35i4qzxlj4y2vae

Inference and analysis of formal models of botnet command and control protocols

Chia Yuan Cho, Domagoj Babi ć, Eui Chul Richard Shin, Dawn Song
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
We propose a novel approach to infer protocol state machines in the realistic high-latency network setting, and apply it to the analysis of botnet Command and Control (C&C) protocols.  ...  We also show that the computed protocol state machines enable formal analysis for botnet defense, including finding the weakest links in a protocol, uncovering protocol design flaws, inferring the existence  ...  While infinite-state protocols can be abstracted with finite-state machines (c.f.  ... 
doi:10.1145/1866307.1866355 dblp:conf/ccs/ChocSS10 fatcat:sj4uh3bjfrdl3oeh4jlgk6ev3e
« Previous Showing results 1 — 15 out of 370,131 results