Filters








533 Hits in 4.2 sec

A Generalised Theory of Interface Automata, Component Compatibility and Error [chapter]

Sascha Fendrich, Gerald Lüttgen
2016 Lecture Notes in Computer Science  
In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established MIA (Modal Interface Automata) theory.  ...  Interface theories allow systems designers to reason about the composability and compatibility of concurrent system components.  ...  We are grateful to Ferenc Bujtor, Walter Vogler and the anonymous reviewers for their helpful suggestions.  ... 
doi:10.1007/978-3-319-33693-0_11 fatcat:icjkooohcbagjgqoiahnuuq47u

Multiparty Compatibility for Concurrent Objects

Roly Perera, Julien Lange, Simon J. Gay
2016 Electronic Proceedings in Theoretical Computer Science  
For simple objects, checking can be exhaustive and has the feel of a type system.  ...  In this paper we show how the idea of multiparty compatibility from the session types literature can be applied to both of these problems.  ...  Supported by EPSRC (EP/K034413/1 and EP/L00058X/1) and COST Action IC1201.  ... 
doi:10.4204/eptcs.211.8 fatcat:i3u7vpybpncjviaqec6eha2g4a

A Strict-Observational Interface Theory for Analysing Service Orchestrations

Philip Mayer, Andreas Schroeder, Sebastian S. Bauer
2010 Electronical Notes in Theoretical Computer Science  
Based on a practical example, we motivate and introduce new notions of refinement and compatibility, and prove that they constitute a valid interface theory.  ...  With this domain-specific interface theory, we provide a framework for application-level analysis of service orchestrations, thus complementing existing work on compatibility analysis.  ...  Acknowledgement This research has been partially supported by the GLOWA-Danube project 01LW0602A2 sponsored by the German Federal Ministry of Education and Research, and the EC project Sensoria, IST-2005  ... 
doi:10.1016/j.entcs.2010.07.009 fatcat:nhd7t4u7m5ajvaaktsqlqc2yja

Methodologies for Specification of Real-Time Systems Using Timed I/O Automata [chapter]

Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman, Andrzej Wąsowski
2010 Lecture Notes in Computer Science  
We present a real-time specification framework based on Timed I/O Automata and a comprehensive tool support for it.  ...  of complex systems from more concrete models; and step-wise modularisation of requirements-to factor out behaviours given by existing available components from a complex global requirements specification  ...  Two timed interfaces are said to be compatible if there exists an environment in which they can work together while avoiding such error states.  ... 
doi:10.1007/978-3-642-17071-3_15 fatcat:nyxkshi5nfhfxgdzcfx5euecvu

Richer interface automata with optimistic and pessimistic compatibility

Gerald Lüttgen, Walter Vogler, Sascha Fendrich
2014 Acta Informatica  
s MIO, which facilitate component-based reasoning of concurrent systems. Our interface theory MIA repaired a compositional flaw of IOMTS-refinement and introduced a conjunction operator.  ...  Modal transition systems are a popular semantic underpinning of interface theories, such as Nyman et al.'s IOMTS and Bauer et al.'  ...  In the light of errors that may arise when joining components in parallel, two schools on MTS-based interface theories have emerged, which treat compatibility either optimistically or pessimistically.  ... 
doi:10.1007/s00236-014-0211-0 fatcat:6lxif3eh6fg2jkry275drezbuu

Nondeterministic Modal Interfaces

Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler
2016 Theoretical Computer Science  
Interface theories are employed in the component-based design of concurrent systems.  ...  They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA.  ...  We thank the reviewers for their comments and suggestions. References  ... 
doi:10.1016/j.tcs.2016.06.011 fatcat:6bvgkib2pfaehclk4jtpewdqym

Nondeterministic Modal Interfaces [chapter]

Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler
2015 Lecture Notes in Computer Science  
Interface theories are employed in the component-based design of concurrent systems.  ...  They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA.  ...  We thank the reviewers for their comments and suggestions. References  ... 
doi:10.1007/978-3-662-46078-8_13 fatcat:rvlxucfmjrfhbgbvxogjcgmf3q

Probabilistic Interface Automata

Esteban Pavese, Victor Braberman, Sebastian Uchitel
2016 IEEE Transactions on Software Engineering  
In this paper we present a probabilistic extension to Interface Automata which preserves pCTL properties under probabilistic fairness by ensuring a probabilistic branching simulation between component  ...  and composite automata.  ...  In that work, the notion of compatibility is also extended to pairs of components, in the sense that a pair (A, B) components are compatible if there exists a third Interface Automaton (the environment  ... 
doi:10.1109/tse.2016.2527000 fatcat:fhu62fduxjhqlpehgqlmbcncre

An algebraic theory of interface automata

Chris Chilton, Bengt Jonsson, Marta Kwiatkowska
2014 Theoretical Computer Science  
We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment.  ...  Outline Section 2 begins by introducing a trace-based theory of interface automata, and defines substitutive refinement, along with the collection of compositional operators.  ...  The authors are supported by EU FP7 project CON-NECT and ERC Advanced Grant VERIWARE. We would also like to thank the anonymous reviewers for their insightful comments.  ... 
doi:10.1016/j.tcs.2014.07.018 fatcat:vxk6ssm655dfbihkxrkyrjuerm

Communication Requirements for Team Automata [chapter]

Maurice H. ter Beek, Josep Carmona, Rolf Hennicker, Jetty Kleijn
2017 Lecture Notes in Computer Science  
We identify a family of representative synchronisation types based on the number of sending and receiving components participating in synchronisations.  ...  Then, we provide a generic procedure to derive, for each synchronisation type, requirements for receptiveness and for responsiveness of team automata that prevent that outputs are not accepted and inputs  ...  Carmona is supported by the Spanish Ministry for Economy and Competitiveness (MINECO) and the EU (FEDER funds) under grant COMMAS (TIN2013-46181-C2-1-R).  ... 
doi:10.1007/978-3-319-59746-1_14 fatcat:c2upwall3nelrg2abllwnb5osm

Compositional assume–guarantee reasoning for input/output component theories

Chris Chilton, Bengt Jonsson, Marta Kwiatkowska
2014 Science of Computer Programming  
We formulate a sound and complete assume-guarantee framework for reasoning compositionally about components modelled as a variant of interface automata.  ...  The specification of a component, which expresses both safety and progress properties of input and output interactions with the environment, is characterised by finite traces.  ...  The authors are supported by EU FP7 project CON-NECT, the ERC Advanced Grant VERIWARE, and the UPMARC centre of excellence.  ... 
doi:10.1016/j.scico.2013.12.010 fatcat:pevcchsovfaxfg6ak75bdriprm

An interface theory for service-oriented design

José Luiz Fiadeiro, Antónia Lopes
2013 Theoretical Computer Science  
One of the major results of the paper is the characterisation of a sub-class of asynchronous relational nets over which we can guarantee that, when binding, through their interfaces, a client and a supplier  ...  A service interface offers properties to potential clients and requires properties of external services that, at run time, may need to be discovered and bound to the orchestration of the service.  ...  Acknowledgments We would like to thank Nir Piterman, Emilio Tuosto and the reviewers of [21] and [22] for many helpful comments and suggestions.  ... 
doi:10.1016/j.tcs.2013.05.011 fatcat:ustq6pqw5fdp3mxxyz5t44loh4

Shacc: A Functional Prototyper for a Component Calculus [chapter]

André Martins, Luís S. Barbosa, Nuno F. Rodrigues
2011 Lecture Notes in Computer Science  
The prototype is built as a HASKELL library endowed with a graphical user interface developed in Swing.  ...  Over the last decade component-based software development arose as a promising paradigm to deal with the ever increasing complexity in software design, evolution and reuse.  ...  The qualificative 'state-based' is used in the sense the word 'state' has in automata theory -the internal memory of the automaton which both constrains and is constrained by the execution of component  ... 
doi:10.1007/978-3-642-22944-2_32 fatcat:vkzylkvfvjaihg67h7ghxz73na

Model-checking Distributed Components: The Vercors Platform

Tomás Barros, Antonio Cansado, Eric Madelaine, Marcela Rivera
2007 Electronical Notes in Theoretical Computer Science  
This article presents a component verification platform called Vercors providing means to analyse the behaviour properties of applications built from distributed components.  ...  From the behavioural specification of primitive components, and from the architectural description of the composite components, our tools build models encoding the interactions between the components,  ...  Components may be bound through their interfaces if typing requirements are met, ensuring a basic compatibility.  ... 
doi:10.1016/j.entcs.2006.09.028 fatcat:nozc7fuumrbebia5yg43z2xssq

Revisiting Timed Specification Theories: A Linear-Time Perspective [article]

Chris Chilton, Marta Kwiatkowska, Xu Wang
2012 arXiv   pre-print
Our theory provides the operations of parallel composition for composing components at run-time, logical conjunction/disjunction for independent development, and quotient for incremental synthesis.  ...  Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports substitutive refinement.  ...  The authors are supported by EU FP7 project CONNECT and ERC Advanced Grant VERIWARE.  ... 
arXiv:1206.4504v1 fatcat:3pzubmtwl5grnkqoxxk3lonwf4
« Previous Showing results 1 — 15 out of 533 results