231 Hits in 5.0 sec

A Symbolic Semantics and Bisimulation for Full Lotos [chapter]

Muffy Calder, Carron Shankland
Formal Techniques for Networked and Distributed Systems  
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to data parameterised behaviours  ...  , and provides a finitely branching representation for behaviours.  ...  Acknowledgments The authors would like to thank Savi Maharaj for useful input on the definition of bisimulation, and Ed Brinksma for many fruitful discussions on reasoning about LOTOS.  ... 
doi:10.1007/0-306-47003-9_12 fatcat:gagdud3opnhszda6zcu6fskr5q

Symbolic bisimulation for Full LOTOS [chapter]

Carron Shankland, Muffy Thomas
1997 Lecture Notes in Computer Science  
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is de ned, following the approach taken for message passing CCS in HL95a], altered to take account of the particular features  ...  Symbolic bisimulation over symbolic transition systems is de ned, and symbolic bisimulation on ground behaviour expressions is shown to preserve the usual concrete (strong) bisimulation on the standard  ...  For the logic, we hypothesise that the logic given above is adequate with respect to symbolic bisimulation on nite processes, but have not yet proved this.  ... 
doi:10.1007/bfb0000491 fatcat:d3jytrnhafd5dpmqtfk34ibmea

An Adequate Logic for Full LOTOS [chapter]

Muffy Calder, Savi Maharaj, Carron Shankland
2001 Lecture Notes in Computer Science  
We present a n o vel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition systems.  ...  The authors would like to thank the Engineering and Physical Sciences Research Council and the Nu eld Foundation Newly Appointed Lecturer scheme for supporting this research.  ...  For example, the relationship between our symbolic semantics and the standard semantics of LOTOS has not yet been fully analyzed.  ... 
doi:10.1007/3-540-45251-6_21 fatcat:hyyo7drbgjap5lns3hf6o5ccmu

A Modal Logic for Full LOTOS based on Symbolic Transition Systems

M. Calder
2002 Computer journal  
The logic has been shown to be adequate with respect to strong early bisimulation over symbolic transition systems derived from Full LOTOS.  ...  This paper presents the syntax and semantics of such a logic and discusses the design issues involved in its construction.  ...  ACKNOWLEDGEMENTS The authors would like to thank the referees for their helpful comments, and the British Council, the Engineering and Physical Sciences Research Council, and the Nu eld Foundation for  ... 
doi:10.1093/comjnl/45.1.55 fatcat:nsk57bd2cjfq5fsfy2v5qttsvy

Expressing Iterative Properties Logically in a Symbolic Setting [chapter]

Carron Shankland, Jeremy Bryans, Lionel Morel
2004 Lecture Notes in Computer Science  
We p r e s e n t a logic for reasoning about LOTOS behaviours which a l l o ws properties involving repeated patterns over actions and data to be expressed.  ...  The semantics of the logic is given with respect to symbolic transition systems. Several motivational examples are included. The reader is assumed to have passing familiarity with LOTOS.  ...  FULL: A modal logic for Full LOTOS FULL was proposed in 3] in order to express properties of STS and to capture the same equivalence as symbolic bisimulation over STS 2] .  ... 
doi:10.1007/978-3-540-27815-3_35 fatcat:ccfuje7k7zerbmp2arpi6xziwu

Combating Infinite State Using Ergo [chapter]

Peter Robinson, Carron Shankland
2003 Lecture Notes in Computer Science  
We present here a theory and tactics for FULL, developed using Ergo, a generalised sequent calculus style theorem prover allowing interactive proofs.  ...  This allows exploitation of the underlying symbolic transition system and reasoning about symbolic values.  ...  Acknowledgements The Engineering and Physical Sciences Research Council (grant GR/M07779/01, DIET: Developing Implementation and Extending Theory, A Symbolic Approach to Reasoning about LOTOS), and the  ... 
doi:10.1007/978-3-540-39979-7_10 fatcat:tccu4d2sl5hrzav37n2dyv6cgu

Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods [chapter]

Frédéric Lang
2005 Lecture Notes in Computer Science  
Mounier (Université Joseph Fourier, Grenoble, France), that combined on-the-fly verification and compositional verification for Lotos [39] .  ...  Exp.Open 2.0 is part of Cadp [19] (Construction and Analysis of Distributed Processes) 1 , a toolbox for protocol engineering that offers functionalities ranging from mere interactive simulation up to  ...  Garavel for many advices during the development of Exp.Open 2.0 and for his constructive remarks on this report.  ... 
doi:10.1007/11589976_6 fatcat:4rxd7fdwtzc67l2yl4vsaezntu

pNets: An Expressive Model for Parameterised Networks of Processes

Ludovic Henrio, Eric Madelaine, Min Madelaine
2015 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing  
Concerning more fundamental aspects, we define a strong bisimulation theory specifically for the pNet model, prove its properties, and illustrate it on some examples.  ...  One of the original aspects of the approach is to relate the compositional nature of pNets with the notion of bisimulation; this is exemplified by studying the properties of a flattening operator for pNets  ...  We propose a behavioural semantics and a bisimulation theory, starting with a strong bisimulation relation for closed pNets.  ... 
doi:10.1109/pdp.2015.70 dblp:conf/pdp/HenrioMM15 fatcat:mvfg2564kvcqxlfjjlkpavcfqe

Building Tools for LOTOS Symbolic Semantics in Maude [chapter]

Alberto Verdejo
2002 Lecture Notes in Computer Science  
We describe a formal tool based on a symbolic semantics for Full LOTOS, where specifications without restrictions in their data types can be executed.  ...  operational semantics, to integrate it with ACT ONE specifications, and to build an entire environment with parsing, pretty printing, and input/output processing of LOTOS specifications.  ...  I would like to thank Carron Shankland for her helpful answers about LOTOS symbolic semantics.  ... 
doi:10.1007/3-540-36135-9_19 fatcat:gadkk64phvgfnfckfgvylcejwa

Automated compositional Markov chain generation for a plain-old telephone system

Holger Hermanns, Joost-Pieter Katoen
2000 Science of Computer Programming  
Obtaining performance models, like Markov chains and queueing networks, for systems of signiÿcant complexity and magnitude is a di cult task that is usually tackled using human intelligence and experience  ...  Finally, we aggregate this model compositionally using appropriate stochastic extensions of (strong and weak) bisimulation.  ...  For the purpose of compositional Markov chain generation, it is su cient to know that the full LOTOS speciÿcation has been extensively veriÿed, and that it can be mapped to a Basic LOTOS description (where  ... 
doi:10.1016/s0167-6423(99)00019-2 fatcat:pdlatyqevbhaznccsdb3jhbena

A Formal Definition of Time in LOTOS

Luc Léonard, Guy Leduc
1998 Formal Aspects of Computing  
The complete semantics is given and explained, and its properties are studied. In particular, we prove that the semantics is consistent and that strong bisimulation is a congruence.  ...  It covers all the aspects of full LOTOS, including data types, it supports both a dense and a discrete time domain and can manipulate time values as any other data values.  ...  Davies, A. Jeffrey, L. Llana, C. Pecheur, J. Quemada, G. Rabay, T. Regan, S. Schneider and S. Yovine for several interesting discussions on ET-LOTOS and its predecessors.  ... 
doi:10.1007/s001650050015 fatcat:frgruoqsjbbppe3yu6ux6q2oqe

Symbolic bisimulation for open and parameterized systems

Zechen Hou, Eric Madelaine
2020 Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2020  
In previous work, a notion of equivalence named FH-Bisimulation was defined for open automata, and proved to be a congruence for their composition.  ...  Open Automata (OA) are symbolic and parameterized models for open concurrent systems. Here open means partially specified systems, that can be instantiated or assembled to build bigger systems.  ...  Acknowledgments This work is partially supported by the National Key Research and Development Project 2017YFB1001800, and the National Natural Science Foundation of China (61972150, 61572195, 61672229,  ... 
doi:10.1145/3372884.3373161 dblp:conf/pepm/HouM20 fatcat:kxvo3qshxnfevj35nbtg3q5xyu

Automating (specification = implementation) using equational reasoning and LOTOS [chapter]

Carron Kirkwood
1993 Lecture Notes in Computer Science  
We use the formal description technique LOTOS [8] for specification and implementation, and equational reasoning, automated by the RIRL term rewriting system [9], for the proof.  ...  We explore some of the problems of verification by trying ~o prove that some sort of relationship holds between a given specification and implementation.  ...  Thanks also to the referees for their helpful comments, and to Deepak Kapur for supplying RRL.  ... 
doi:10.1007/3-540-56610-4_88 fatcat:mtbm2rycovekfibtqi5unq7lgi

Two Case Studies of Semantics Execution in Maude: CCS and LOTOS

Alberto Verdejo, Narciso Martí-Oliet
2005 Formal methods in system design  
The same techniques are also used to implement a symbolic semantics for LOTOS in our second case study.  ...  We explore the features of rewriting logic and, in particular, of the rewriting logic language Maude as a logical and semantic framework for representing and executing inference systems.  ...  We would like to thank David Basin for his very fruitful comments about the Isabelle/HOL foundations, and Carron Shankland for her help and explanations about the LOTOS symbolic semantics.  ... 
doi:10.1007/s10703-005-2254-x fatcat:zhh27qp5tzdcpato76kjtbqc5u

On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP

Hubert Garavel, Gwen Salaün, Wendelin Serwe
2009 Science of Computer Programming  
In this article, we first give a structural operational semantics for value-passing Chp.  ...  toolbox for Lotos.  ...  We also thank the same colleagues from Cea/Leti laboratory for their cooperation in the Des and Anoc case studies.  ... 
doi:10.1016/j.scico.2008.09.011 fatcat:dfr35qxbnrbqhfwi6yayio7wwu
« Previous Showing results 1 — 15 out of 231 results