Filters








246,921 Hits in 5.6 sec

Transforming sequential systems into concurrent systems

Ryszard Janicki
1985 Theoretical Computer Science  
The method is based on the theory of path expressions. The notion of functional equivalence is formally defined and studied.  ...  A functionally equivalent system is first specified, then a set of independent actions or abstract resources is devised, and, finally, this sequential system is transformed into an equivalent concurrent  ...  Acknowledgment The author would like to thank Peter Lauer for his suggestions, comments and criticism, and for the invitation to Newcastle-upon-Tyne.  ... 
doi:10.1016/0304-3975(85)90029-5 fatcat:xalh5r57afd4zbx4n7shi4opbu

Page 980 of Mathematical Reviews Vol. , Issue 87b [page]

1987 Mathematical Reviews  
{For the entire collection see MR 87a:68019.} 87b:68026 Janicki, Ryszard (PL-WASWT) 87b:68027 An equivalence notion for path expressions systems. (German and Russian summaries) Elektron.  ...  Some sufficient criteria for the equivalence of these semantics are formulated. As an abstract model of nonsequential systems the COSY path expression for- malism is used.”  ... 

Reasoning about Programs With Effects

Carolyn Talcott
1998 Electronical Notes in Theoretical Computer Science  
The work on components of open distributed systems has been based on the actor model of computation and has focused on developing semantic models for modular speci cation and composition of actor systems  ...  Talcott actor model of computation and has focused on developing semantic models for modular speci cation and composition of actor systems.  ...  Various notions of testing equivalence on actor expressions are de ned in analogy to the notions de ned for process algebra 6].  ... 
doi:10.1016/s1571-0661(05)80243-9 fatcat:b6mazjhf2rao3erdapa3qcwoti

Actors and Logical Analysis of Interactive Systems

Ian A. Mason, Carolyn L. Talcott
2005 Electronical Notes in Theoretical Computer Science  
In this paper we briefly review the notion of interaction semantics for actor systems, and report on work in progress to formalize this interaction model.  ...  One is to provide language and principles for specification of and reasoning about such systems.  ...  We first make precise our notion of satisfaction. As discussed above, an actor system specification is a predicate on interaction paths.  ... 
doi:10.1016/j.entcs.2005.05.019 fatcat:mxnicvglazdqngk46ly4ehau3u

Introduction [chapter]

Marlon Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede
2005 Process-Aware Information Systems  
This paper aims at providing some of the formal groundwork for studying relative expressiveness and variability by defining notions of equivalence capturing different views on how workflow systems operate  ...  ., there is an alternation between system events and environment interactions.  ...  This work is partially funded by an ARC Discovery Grant "Expressiveness Comparison and Interchange Facilitation between Business Process Execution Languages".  ... 
doi:10.1002/0471741442.ch1 fatcat:gqxtolzc7rafpjefbk6hor4zcq

Layered Composition for Timed Automata [chapter]

Ernst-Rüdiger Olderog, Mani Swaminathan
2010 Lecture Notes in Computer Science  
This is illustrated by considering a collision avoidance protocol developed for an audio/video system of Bang and Olufsen.  ...  We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA).  ...  We wish to thank the reviewers for useful feedback. References  ... 
doi:10.1007/978-3-642-15297-9_18 fatcat:4gzqxvuklvfhxcl3zanaquv4cu

Progress, Justness and Fairness [article]

Rob van Glabbeek, Peter Höfner
2018 arXiv   pre-print
As an alternative we introduce the concept of justness.  ...  Fairness assumptions are a valuable tool when reasoning about systems.  ...  Example 6, for instance, needs an infinite transition system to express that after each a-transition a different b-event is enabled, and likewise for Examples 4, 7, 11 and 12.  ... 
arXiv:1810.07414v1 fatcat:nxpr7shw2feonjpmcy2g6rpshm

Computation on graph-like expressions

John Staples
1980 Theoretical Computer Science  
It asserts a modified commutativity property for computational steps in suitable systems of graph-like expressions.  ...  This paper begins a three-part study of efficient evaluations of expressions, which shows that for a wide class of expressions there are theoretical benefits in allowing graph-like expressions in evaluation  ...  In the conveeiltional system there are two constants S and K, which are expressions, and for all expressions Tl and T2, ( Tl T2) is an expression.  ... 
doi:10.1016/0304-3975(80)90013-4 fatcat:hef36gjvznbwndikujy7rmc2f4

Automata for the mu-calculus and Related Results

David Janin, Igor Walukiewicz
1995 BRICS Report Series  
This kind of formula gives rise to a new notion of finite automaton<br />which characterizes the expressive power of the mu-calculus over<br />all transition systems.  ...  The notion of disjunctive formula is defined and it is shown<br />that every formula is semantically equivalent to a disjunctive formula.  ...  Moreover on any infinite path there is one and only one infinite trace. Theorem. For every formula there exists an equivalent disjunctive formula. Proof. Let T be a regular tableau for a formula γ.  ... 
doi:10.7146/brics.v2i27.19929 fatcat:hsthe4di6bf55meny7epqjgnfu

A meaning explanation for HoTT

Dimitris Tsementzis
2019 Synthese  
Finally, I outline a pre-formal meaning explanation for HoTT based on spatial notions like "shape", "path", "point" etc. which in particular provides an intuitive justification of the axiom of univalence  ...  I then explain why Martin-Löf's original meaning explanation for type theory no longer applies to HoTT.  ...  But by (U) we know that any path can only be turned into an equivalence in a unique way and that conversely every equivalence uniquely determines a path.  ... 
doi:10.1007/s11229-018-02052-1 fatcat:mk4yqqe74rbxhoyh3cqi5nfrea

Safe Equivalences for Security Properties [chapter]

Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum
2010 IFIP Advances in Information and Communication Technology  
protocol P with a variable x satisfies such property if and only if, for every pair of secrets s1 and s2, P [ s 1 /x] is equivalent to P [ s 2 /x].  ...  In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference) based on the principle that a  ...  The authors wish to thank the anonymous reviewers for their useful comments, and Pedro D'Argenio for helpful discussion.  ... 
doi:10.1007/978-3-642-15240-5_5 fatcat:g5vlvv32grbi7er5b6s6nmgdym

Branching Bisimulation Congruence for Probabilistic Systems

Nikola Trčka, Sonja Georgievska
2008 Electronical Notes in Theoretical Computer Science  
A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible with parallel composition, is defined.  ...  For a congruence result, an internal transition immediately followed by a non-trivial probability distribution is not considered inert.  ...  pCTL We present the logic that we use to express properties of probabilistic systems.  ... 
doi:10.1016/j.entcs.2008.11.023 fatcat:maf5mb4n3fgbrmgqa3xkrucloa

Branching bisimulation congruence for probabilistic systems

Suzana Andova, Sonja Georgievska, Nikola Trčka
2012 Theoretical Computer Science  
A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible with parallel composition, is defined.  ...  For a congruence result, an internal transition immediately followed by a non-trivial probability distribution is not considered inert.  ...  pCTL We present the logic that we use to express properties of probabilistic systems.  ... 
doi:10.1016/j.tcs.2011.07.020 fatcat:kgvk6dhpajcujibhoiwqt5gcmu

It usually works: The temporal logic of stochastic systems [chapter]

Adnan Aziz, Vigyan Singhal, Felice Balarin, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
1995 Lecture Notes in Computer Science  
We conclude by describing practical and theoretical avenues for further work.  ...  We extend the universe of models to generalized Markov processes in order to support notions of refinement, abstraction, and parametrization.  ...  Notation: Given an equivalence relation g C S x S, Cs = {C1,C2,...,Ct} is the corresponding partition of S. We will write T(s, Ci) for L:tec, (T(s, t)).  ... 
doi:10.1007/3-540-60045-0_48 fatcat:jgytbviwxrcidphjfnioy6atse

Page 44 of Mathematical Reviews Vol. , Issue 97A [page]

1997 Mathematical Reviews  
In this technically interesting paper, the authors prove the equivalence of regular paths with yet an- other notion, “persistent” paths.  ...  Indeed, in work with Asperti and Laneve, they showed the equivalence of several notions of “reduction” paths in lambda calculus (e.g.  ... 
« Previous Showing results 1 — 15 out of 246,921 results