63 Hits in 3.1 sec

On the implementation of concurrent calculi in net calculi: two case studies

Roberto Gorrieri, Ugo Montanari
1995 Theoretical Computer Science  
system for RCCS to net for SCONE.  ...  The result is a finite net implementation for RCCS agents. By making the quotient of the RCCS transition system w.r.t. the implementation mapping, we induce a truly concurrent semantics for RCCS.  ...  Acknowledgement We would like to thank the anonymous referees for their comments and suggestions which were very helpful in the preparation of the revised version of this paper.  ... 
doi:10.1016/0304-3975(94)00073-r fatcat:yk2wlxrwfzgwpnu7hk5xc5juwe

Structuring specifications in-the-large and in-the-small: Higher-order functions, dependent types and inheritance in SPECTRAL [chapter]

Bernd Krieg-Brückner, Donald Sannella
1991 Lecture Notes in Computer Science  
Of particular concern are the means for structuring specifications and programs in-thelarge and in-the-small.  ...  Concepts of subtyping and (object-oriented) inheritance are included to support the specification development process and to enhance re-usability.  ...  paper has benefitted from discussions with Manfred Broy, Jörn von Holten, Yunbo Liu, Fernando Orejas, Frank Pfenning, Zhenyu Qian, Horst Reichel, Stefan Sokolowski, Andrzej Tarlecki, Martin Wirsing, and  ... 
doi:10.1007/3540539816_74 fatcat:beeynmwe4jbsfo2m43upmuytee

A formal semantics for Gaia liveness rules and expressions

Tim Miller, Peter McBurney
2007 International Journal of Agent-Oriented Software Engineering  
In this paper, we present a formal semantics for liveness rules and expressions, and discuss our work in developing axioms about them.  ...  The Gaia methodology is a development methodology for multi-agent systems that uses the concept of roles to define behaviour.  ...  and Health Services (IST-FP6-507019) and the UK Engineering and Physical Sciences Research Council (EPSRC), through the Project Market-Based Control of Complex Computational Systems (GR/T19742/01).  ... 
doi:10.1504/ijaose.2007.016268 fatcat:ztxlxdcumbdvpndjmt6bsubniq

A semi-algorithm for algebraic implementation proofs

Rolf Hennicker
1992 Theoretical Computer Science  
., A semi-algorithm for algebraic implementation proofs, Theoretical Computer Science 104 (1992) 53-87.  ...  In this paper a semi-algorithm for the proof of behavioural implementations of algebraic specifications is developed which provides the basis for an interactive system for algebraic implementation proofs  ...  A semi-algorithm for the proof of behavioural implementations of algebraic specifications providing the basis for an interactive system for implementation proofs is presented.  ... 
doi:10.1016/0304-3975(92)90166-d fatcat:e3s5le4tl5djzbhq6ky6yl3f6a

Semantics for finite delay

Chrysafis Hartonas
1997 Theoretical Computer Science  
The model uses Aczel's anti-foundation axiom and it is constructed along the lines of the anti-founded model for SCCS given by Aczel.  ...  My thanks and gratitude go the faculty of the department, particularly the Section of Algebra and Geometry, for providing me with the facilities to continue my research.  ...  We think of the process algebra for SCCS + E as a pre-ordered algebra 2 = (L, =, <, C) where < is a pre-order and Z is the signature of operators of SCCS+s.  ... 
doi:10.1016/s0304-3975(96)00095-3 fatcat:qdyvcotoffelbe4du4gwr3y5de

Concurrency and atomicity

G. Boudol, I. Castellani
1988 Theoretical Computer Science  
The action reflects the causal and concurrent structure of the process, and we claim that the bisimulation relative to such transition systems brings out a clear distinction between concurrency and sequential  ...  Next we introduce a second transition relation, formalizing the operation of a process on data.  ...  Let @ be the equational theory whose axioms are A0 to A2, UO to U2, Cl and C2, and let =8 be the congruence on +""(A) generated by these equations.  ... 
doi:10.1016/0304-3975(88)90096-5 fatcat:iv3igywltvcgnjaj7pt7dvapxa

My ADT Shrine [chapter]

Hans-Dieter Ehrich
2012 Lecture Notes in Computer Science  
His group used a triple of layers to model information systems, data-objects-systems, where the focus of interest now was on objects and systems. The interest in data issues paled in comparison.  ...  Around 1982, the emphasis of his work moved to databases and information systems, in particular conceptual modeling.  ...  In the final reviewing process, the three anonymous referees were very friendly and helped a lot to improve the paper. Many thanks to them!  ... 
doi:10.1007/978-3-642-28412-0_2 fatcat:sk7ds3rypzbabfxqxclfygfr3u

A perceptual account of symbolic reasoning

David Landy, Colin Allen, Carlos Zednik
2014 Frontiers in Psychology  
powerful perceptual and sensorimotor systems.  ...  Although symbolic reasoning often conforms to abstract mathematical principles, it is typically implemented by perceptual and sensorimotor engagement with concrete environmental structures.  ...  One possibility is that because the algebraic system tends to align spatial structure and precedence rules, perceptual grouping processes acquire biases compatible with those rules (Kirshner and Awtry  ... 
doi:10.3389/fpsyg.2014.00275 pmid:24795662 pmcid:PMC4001060 fatcat:byvhlobpzndvdjkkklbmrijo4q

An algebraic perspective of constraint logic programming

F. de Boer
1997 Journal of Logic and Computation  
In particular, by de ning our domain as a cylindric Heyting algebra, we can exploit, to this aim, operations of both cylindric algebras (such as cylindri cation), and Heyting algebras (such as implication  ...  The denotational approach turns out very useful for the de nition of new operators on the language as the counterpart of some abstract operations on the denotational domain.  ...  Acknowledgements We would like to thank Daniele Micciancio for his helpful comments on a rst draft of this paper.  ... 
doi:10.1093/logcom/7.1.1 fatcat:wd4gawev5fc4fn34rt4wm3kgne

Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations

David de Frutos Escrig, Carlos Gregorio Rodríguez
2008 Electronical Notes in Theoretical Computer Science  
This nested nature provides a fruitful framework for the study of the formal meaning and the properties of concurrent processes.  ...  In particular, we provide an axiomatization for both the preorder and the equivalence induced by any constrained simulation.  ...  The operational semantics for BCCSP terms is defined by a labelled transition system (lts) and is given by the rules in Figure 1 .  ... 
doi:10.1016/j.entcs.2008.03.074 fatcat:fhp7tktrsfdn5jcodzijm7zxhu

The Operational Semantics of Action Notation

Peter D. Mosses
1992 DAIMI Report Series  
It is defined by a structural operational semantics together with a bisimulation-based equivalence that satisfies some simple algebraic laws.  ...  Action notation is used in the action semantics fratnework, for specifying actions representing program behaviour.  ...  Operational Semantics We use a variant of structural operations semantic [14, 1] to define a transition system.  ... 
doi:10.7146/dpb.v21i418.6731 fatcat:ndzc6ztxpbdyrimvgwpxg6unoi


2016 Ecoforum  
It involves different stakeholders and offers a transparent process for prioritizing, and finally, selecting security measures.  ...  The use of and the strengths and weaknesses of the framework should be pre-tested within the stage of planning process and simulation of predictable threats.  ...  , equations and inequalities), on knowledge of mathematical theories (mathematical logic, set theory, statistics, probability, theory of equations, geometry, theory of algebraic structure, etc.), mathematical  ... 
doaj:f56c7394005c4b4eb9465d64298a7352 fatcat:abdnodkudfdzpfdoz353et3bre

Amalgamation in the semantics of CASL

Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman
2005 Theoretical Computer Science  
Moreover, amalgamation for enriched Casl means that a variety of results for institutions with amalgamation, such as computation of normal forms and theorem proving for structured specifications, can now  ...  be used for Casl.  ...  Moreover, we wish to thank Michel Bidoit and Donald Sannella for collaboration on architectural specifications, Fernando Orejas for reference [35] , and Maura Cerioli for pointing out the failure of amalgamation  ... 
doi:10.1016/j.tcs.2004.09.037 fatcat:axirxybyk5eb3lidxm4hqqgrcy

Cylindric and polyadic algebras, new perspectives [article]

Tarek Sayed Ahmed
2013 arXiv   pre-print
Several algebraic properties (like amalgamation) are proved for instances of systems of varieties definable by such a schema like MV algebras, reducts of Heyting polyadic algebras and Ferenczi's cylindric  ...  We also give a general new definition of a schema for infinite dimensions covering Monk's schema and Halmos' schema.  ...  To make our argument of the lifting process, as general as much as possible, we introduce the new notion of a system of varieties of Boolean algebras with operators definable by a schema.  ... 
arXiv:1309.0681v1 fatcat:35vlva4kpvdd3cl6ihc4dkjl3y


2011 The Review of Symbolic Logic  
We consider notions of truth and logical validity defined in various recent constructions of Hartry Field.  ...  We try to explicate his notion of determinate truth by clarifying the path dependent hierarchies of his determinateness operator.  ...  operators for any recursive ordinal.  ... 
doi:10.1017/s1755020311000049 fatcat:ojbuxauksreidhmjrjsk3mbto4
« Previous Showing results 1 — 15 out of 63 results