Filters

766 Hits in 5.4 sec

### Enhancements of the bisimulation proof method [chapter]

Damien Pous, Davide Sangiorgi, Davide Sangiorgi, Jan Rutten
Advanced Topics in Bisimulation and Coinduction
substitutions) page 38 Conclusions, part I -Enhancements of the bisimulation proof methods: extremely useful * essential in π-calculus-like languages, higher-order languages -Various forms of enhancement  ...  P , as the transitions are the same) Process abbreviations: a a. 0 P n P | . . . | P (n times) page 4 Enhancements of the bisimulation method: an example A property of replication !(a + b) ∼ !a | !  ...  Equivalence between the two machines  ...

### Bisimulation Proof Methods for Mobile Ambients [chapter]

Massimo Merro, Francesco Zappa Nardelli
2003 Lecture Notes in Computer Science
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients.  ...  We also provide two up-to proof techniques that we use to prove a set of algebraic laws, including the perfect firewall equation.  ...  Acknowledgements The authors would like to thank Vladimiro Sassone who spotted a problem in an early draft of the paper. The anonymous referees contributed useful comments.  ...

### Formal Methods for Systems Engineering Behavior Models

C. Seidner, O.H. Roux
2008 IEEE Transactions on Industrial Informatics
This paper thus aims at improving the verification practice in SE design: considering the widely-used model of EFFBDs (Enhanced Function Flow Block Diagrams), it formally establishes its syntax and behavioral  ...  Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however powerful and mature, are deemed too  ...  For any EFFBD E with the semantics (S, s 0 , N , →) and a given k ∈ N, the following problem is decidable: ∀(A, C, I, ν) ∈ S, ∀A ∈ I, I(A) ≤ k Proof: Using proposition 5 and theorem 6, the proof is immediate  ...

### Globally Governed Session Semantics

Dimitrios Kouzapas, Nobuko Yoshida, Davide Sangiorgi
2014 Logical Methods in Computer Science
The difference between the governed and standard bisimulations only appears when more than two interleaved multiparty sessions exist.  ...  The induced bisimulation is strictly more fine-grained than the standard session bisimulation.  ...  The work has been partially sponsored by the Ocean Observatories Initiative, EPSRC EP/K011715/1, EP/K034413/1, EP/G015635/1 and EP/L00058X/1, and EU project FP7-612985 UpScale.  ...

### On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Marina Gelastou, Chryssis Georgiou, Anna Philippou
2008 2008 Seventh IEEE International Symposium on Network Computing and Applications
To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies  ...  In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol.  ...  The choice of the protocol was made based on two facts: (a) the leader election problem is a fundamental problem in distributed computing and hence, an interesting problem to consider, and (b) the protocol  ...

### The Proof Technique of Unique Solutions of Contractions [chapter]

Davide Sangiorgi
2015 Lecture Notes in Computer Science
represents an open problem.  ...  In proofs of bisimilarity results, the bisimulation proof method has become predominant, particularly with the enhancements of the method provided by the so called 'up-to techniques' [29] .  ...

### Stream Differential Equations: Specification Formats and Solution Methods [article]

Helle Hvid Hansen, Clemens Kupke, Jan Rutten
2016 arXiv   pre-print
Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS.  ...  Our focus is on the classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define.  ...  For all σ, we have: We conclude this section by an enhancement of the bisimulation proof method. The general result behind the soundness of this method is described in Section 9.3.  ...

### On regions and zones for event-clock automata

Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2014 Formal methods in system design
This means in particular that regions do not form a time abstract bisimulation.  ...  Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs).  ...  and the language inclusion problem (does L(A) ⊆ L(B) ?).  ...

### A Junction Between State Based and Behavioural Specification [chapter]

H. Bowman, J. Derrick
1999 Formal Methods for Open Object-Based Distributed Systems
Two of the dominant paradigms for formally describing and analysing 00 distributed systems are state based specification, e.g. Object-Z, and behavioural specification, e.g. process algebra.  ...  This paper serves two purposes -firstly, it reviews the existing body of work on relating these two specification paradigms and secondly, it presents some new results on the topic.  ...  , Maarten Steen and Ben Strulo.  ...

### Environmental Bisimulations for Higher-Order Languages

Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
2007 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with "up-to context" techniques, and (2) obtaining definitions and results that scale  ...  context, as examples of possible enhancements of the associated bisimulation method.  ...  We are grateful to Vassileios Koutavas: discussions with him in the initial development of this work were helpful in clarifying concepts. We would like also to thank Kohei Suenaga for comments.  ...

### Environmental bisimulations for higher-order languages

Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
2011 ACM Transactions on Programming Languages and Systems
Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with "up-to context" techniques, and (2) obtaining definitions and results that scale  ...  context, as examples of possible enhancements of the associated bisimulation method.  ...  We are grateful to Vassileios Koutavas: discussions with him in the initial development of this work were helpful in clarifying concepts. We would like also to thank Kohei Suenaga for comments.  ...

### Tower Induction and Up-to Techniques for CCS with Fixed Points [chapter]

Steven Schäfer, Gert Smolka
2017 Lecture Notes in Computer Science
We present a refinement of Pous' companion-based coinductive proof technique and apply it to CCS with general fixed points.  ...  We show that relative bisimilarity is a congruence, a basic result implying soundness of bisimulation up to context. The entire development is constructively formalized in Coq.  ...  Fortunately, there are several enhancements of the coinductive proof method, which mitigate these problems.  ...

### Symbolic bisimulation for open and parameterized systems

2020 Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2020
We prove that this algorithm terminates when the data domains are finite. Both algorithms use an SMT-solver as a basis to solve the proof obligations.  ...  Then we propose two algorithms to check StrFH-Bisimulation: the first one requires a (user-defined) relation between the states of two finite OAs, and checks whether it is a StrFH-Bisimulation.  ...  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,  ...

### Formal methods for the specification and design of real-time safety critical systems

Jonathan S. Ostroff
1992 Journal of Systems and Software
This paper surveys formal methods for specifying, designing and verifying real-time systems, so as to improve their safety and reliability.  ...  Computers control the planes we y on, monitor our health in hospitals and do our work in hazardous environments.  ...  Pragmatics | Semi-automated proof and synthesis methods: A proof system, with perhaps some small examples to illustrate the method of proof, is not on its own su cient to make the proof system practically  ...

### Presenting Distributive Laws

Marcello Bonsangue, Helle Hansen, Alexander Kurz, Jurriaan Rot, Stefan Milius
2015 Logical Methods in Computer Science
proof method.  ...  They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation  ...  More technically, it remains an open problem whether a converse of Proposition 5.1 holds. We intend to investigate this matter in future work.  ...
« Previous Showing results 1 — 15 out of 766 results