200 Hits in 4.6 sec

Characteristic bisimulation for higher-order session processes

Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida
2016 Acta Informatica  
a precise finite set of higher-order values suffices to reason about higher-order session processes.  ...  For higher-order (process) languages, characterising contextual equivalence is a long-standing issue.  ...  Pérez is also affiliated to the NOVA Laboratory for Computer Science and Informatics (NOVA LINCS), Universidade Nova de Lisboa, Portugal.  ... 
doi:10.1007/s00236-016-0289-7 pmid:32103830 pmcid:PMC7010397 fatcat:2mhbxewq3rczdjjtbpqsl4if4q

Core Higher-Order Session Processes: Tractable Equivalences and Relative Expressiveness [article]

Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida
2015 arXiv   pre-print
This work proposes tractable bisimulations for the higher-order pi-calculus with session primitives (HOpi) and offers a complete study of the expressivity of its most significant subcalculi.  ...  We show that HOpi, HO, and pi are equally expressive; the expressivity of HO enables effective reasoning about typed equivalences for higher-order processes.  ...  -The characteristic bisimulation introduces a uniform approach not only for higher-order values but for first-order values as well, i.e. triggered process can accept any process that can substitute a first-order  ... 
arXiv:1502.02585v2 fatcat:bml6mpivyjhh5c3txsy6utyf4e

Front Matter, Table of Contents, Preface, Committees, External Reviewers

Luca Aceto, David De Frutos Escrig, Marc Herbstritt
2015 International Conference on Concurrency Theory  
Characteristic Bisimulations for Higher-Order Session Processes Dimitrios Kouzapas, Jorge A. Pérez, and Nobuko Yoshida . . . . . . . . . . . . . . . . . . . . . . . .  ...  Lax Bialgebras and Up-To Techniques for Weak Bisimulations Filippo Bonchi, Daniela Petrişan, Damien Pous, and Jurriaan Rot . . . . . . . . . . . . . .  ... 
doi:10.4230/lipics.concur.2015.i dblp:conf/concur/X15 fatcat:xk6gbzxaynbpbcgklezhf2zn6m

Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)

Luca Aceto, David de Frutos Escrig
2017 Acta Informatica  
The second paper, co-authored by Kouzapas, Perez and Yoshida, presents a notion of characteristic bisimilarity that characterises contextual equivalence in the setting of a higher-order π-calculus with  ...  session types.  ... 
doi:10.1007/s00236-017-0292-7 fatcat:okji7cahqbhodh2n2mm2y33zdm

Designing the Minimal Structure of Hidden Markov Model by Bisimulation [chapter]

Manuele Bicego, Agostino Dovier, Vittorio Murino
2001 Lecture Notes in Computer Science  
Bisimulation allows to merge HMM states in order to obtain a minimal set that do not significantly affect model performances.  ...  In this paper, instead, we use the notion of probabilistic bisimulation to automatically and efficiently determine the minimal structure of HMM.  ...  In order to minimize the number of nodes of a graph, we look for the maximal bisimulation ≡ on G.  ... 
doi:10.1007/3-540-44745-8_6 fatcat:vll3sjpiobdg7cs2dpv32yqdpu

On asynchronous eventful session semantics

2014 Mathematical Structures in Computer Science  
The new typed bisimulation theory developed for the ESP model is distinct from standard synchronous or asynchronous bisimulation, capturing the semantic nature of eventful session-based processes.  ...  The main characteristics of the ESP model are asynchronous, order-preserving message passing, non-blocking detection of event/message arrivals and dynamic inspection of session types.  ...  building other higher-level event-based programming libraries.  ... 
doi:10.1017/s096012951400019x fatcat:hvhpkklxdncvtahczajg5fkwc4

On the Relative Expressiveness of Higher-Order Session Processes [chapter]

Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida
2016 Lecture Notes in Computer Science  
By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes.  ...  By exploring a new bisimulation for HO, we show that HO can encode HOπ fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session π-calculus (π).  ...  We are grateful to the anonymous reviewers for their useful remarks and suggestions.  ... 
doi:10.1007/978-3-662-49498-1_18 fatcat:jcx6brqljbcebkizk4cdjeatyu

On the Expressiveness of Parameterization in Process-Passing [chapter]

Xian Xu, Qiang Yin, Huan Long
2014 Lecture Notes in Computer Science  
This paper studies higher-order processes with the capability of parameterization (or abstraction), which has been proven to be an effective measure of lifting the mere process-passing in expressiveness  ...  Firstly, we show that in the expressiveness hierarchy of process-parameterization, n-ary parameterization can faithfully translate (n+1)-ary parameterization in a linear setting where each received process  ...  Acknowledgement The authors thank the members of the BASICS lab and the anonymous referees for their comments and suggestions.  ... 
doi:10.1007/978-3-319-08260-8_9 fatcat:krw4seqlnje7jc4kvvu43gkoh4

Towards a Process Calculus for Rest: Current State of the Art

Dariusz Dwornikowski, Andrzej Stroiński, Jerzy Brzeziński
2015 Foundations of Computing and Decision Sciences  
In order to address problems of modeling and verification of Web services, several process calculi have been proposed for SOAP-based Web services but none for the RESTful Web services based systems.  ...  Finally, basing on the survey, requirements for a new process calculus specific for REST are defined.  ...  We feel that classic bisimulation could be suited to REST and ROA systems in order to catch different aspects of processes.  ... 
doi:10.1515/fcds-2015-0015 fatcat:lwxcsr2pezemzdshu3atwfx674

A Calculus for Mobile Ad-hoc Networks with Static Location Binding

Jens Chr. Godskesen
2009 Electronical Notes in Theoretical Computer Science  
We present a process calculus for mobile ad hoc networks which is a natural continuation of our earlier work on the process calculus CMAN [6].  ...  ease of proofs and being strictly contained in the contextual bisimulation.  ...  We let the new name operator have higher precedence than the hiding operator which in turn has higher precedence than the left associative parallel composition. We write p l instead of p l .  ... 
doi:10.1016/j.entcs.2009.06.018 fatcat:sl2xt4fwinfzzougn5lbsoymsi

An Algebra of Behavioural Types

António Ravara, Pedro Resende, Vasco T. Vasconcelos
2012 Information and Computation  
A type is a higher-order labelled transition system that characterises all possible life cycles of a concurrent object.  ...  We propose a process algebra, the Algebra of Behavioural Types, as a language for typing concurrent objects.  ...  Acknowledgments Special thanks to Gérard Boudol, Ilaria Castellani, Silvano Dal Zilio, and Massimo Merro, for fruitful discussions and careful reading of parts of this document.  ... 
doi:10.1016/j.ic.2011.12.005 fatcat:u4ske5sttrf35kmzmqellvuyye

The fork calculus [chapter]

Klaus Havelund, Kim G. Larsen
1993 Lecture Notes in Computer Science  
In CCS there is a binary parallel operator |, and two processes p and q are put in parallel by p|q.  ...  In FC there is a unary fork operator, and a process p is activated to "run in parallel with the rest of the program" by fork(p).  ...  The Fork-rule shows how the higher order labels φ(p) are created. When we come to the program semantics their use will be explained.  ... 
doi:10.1007/3-540-56939-1_101 fatcat:5v66kuk7nfagritx3sopxorrsy

On Combining Functional Verification and Performance Evaluation Using CADP [chapter]

Hubert Garavel, Holger Hermanns
2002 Lecture Notes in Computer Science  
In this paper, we describe how the Cadp toolbox, originally designed for verifying the functional correctness of Lotos specifications, can also be used for performance evaluation.  ...  Considering functional correctness and performance evaluation in a common framework is desirable, both for scientific and economic reasons.  ...  We are grateful to Massimo Zendri for bringing the Scsi-2 example to our attention, and to Moëz Cherif (formerly at Inria/Vasy) for helping us to develop the Bcg Min tool.  ... 
doi:10.1007/3-540-45614-7_23 fatcat:o4cd2ykrizawpjnfzyz4s4gszm

Model Checking for Nominal Calculi [chapter]

Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
2005 Lecture Notes in Computer Science  
Names have been used in process calculi for representing a variety of different informations concerning addresses, mobility links, continuations, localities, causal dependencies, security keys and session  ...  Among the properties which can be checked, behavioural equivalence is especially important for matching specifications and implementations, for proving the system resistant to certain attacks and for replacing  ...  Acknowledgements The authors thank Vladimiro Sassone and Pawel Sobocinski for their helpful comments on an earlier draft of this paper.  ... 
doi:10.1007/978-3-540-31982-5_1 fatcat:kclgj4xut5dgfkeey6u226nfey

On Teaching Discrete Mathematics to Freshman Computer Science Students

2019 Journal of Higher Education Theory and Practice  
As described later through characteristic examples, riddles and games provide an effective way to instil the rigours of computational thinking. Use regular interactive small-group problem sessions.  ...  Keep these problem session groups small.  ... 
doi:10.33423/jhetp.v19i8.2670 fatcat:6ddc5a52qzewfeyc6wpsq3drva
« Previous Showing results 1 — 15 out of 200 results