scholarly journals CCS, Locations and Asynchronous Transition Systems

1992 ◽  
Vol 21 (395) ◽  
Author(s):  
Madhavan Mukund ◽  
Mogens Nielsen
Keyword(s):  
Operational Semantics ◽  
Transition System ◽  
Additional Property ◽  
Close Correspondence ◽  
Transition Systems ◽  
Natural Way

<p>Our aim is to provide a simple non-interleaved operational semantics for CCS in terms of a model that is easy to understand - asynchronous transition systems. Our approach is guided by the requirement that the semantics should identify the concurrency present in the system in a natural way, in terms of events occurring at independent locations in the system.</p><p>We extend the standard interleaving transition system for CCS by introducing labels on the transitions with information about the locations of events. We then show that the resulting transition system is an asynchronous transition system which has the additional property of being <em>elementary</em>, which means that it can also be represented by a 1-safe net. We establish a close correspondence between our semantics and other approaches in terms of <em>foldings</em>.</p><p>We also introduce a notion of bisimulation on asynchronous transition systems which preserves independence. We conjecture that the induced equivalence on CCS processes coincides with the notion of <em>location equiualence</em> proposed by Boudol et al.</p>

PETRI NETS AND STEP TRANSITION SYSTEMS

1992 ◽  
Vol 03 (04) ◽  
pp. 443-478 ◽  
Author(s):  
MADHAVAN MUKUND
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Transition System ◽  
Computing Systems ◽  
Transition Systems ◽  
Labelled Transition Systems ◽  
Natural Sense ◽  
Step Transition ◽  
Operational Behaviour ◽  
Natural Way

Labelled transition systems are a simple yet powerful formalism for describing the operational behaviour of computing systems. They can be extended to model concurrency faithfully by permitting transitions between states to be labelled by a collection of actions, denoting a concurrent step. Petri nets (or Place/Transition nets) give rise to such step transition systems in a natural way—the marking diagram of a Petri net is the canonical transition system associated with it. In this paper, we characterize the class of PN-transition systems, which are precisely those step transition systems generated by Petri nets. We express the correspondence between PN-transition systems and Petri nets in terms of an adjunction between a category of PN-transition systems and a category of Petri nets in which the associated morphisms are behaviour-preserving in a strong and natural sense.

AN OPERATIONAL SEMANTICS FOR THE PARALLEL LANGUAGE EDEN

2002 ◽  
Vol 12 (02) ◽  
pp. 211-228 ◽  
Author(s):  
MERCEDES HIDALGO-HERRERO ◽  
YOLANDA ORTEGA-MALLÉN
Keyword(s):  
Operational Semantics ◽  
Transition System ◽  
Lazy Evaluation ◽  
Parallel Language ◽  
Parallel Processes ◽  
System A ◽  
Independent Evaluation ◽  
Level Transition ◽  
Concurrent Algorithms ◽  
Main Thread

The functional parallel language Eden — suitable for the description of parallel and concurrent algorithms in a distributed setting — is an extension of Haskell with a set of coordination features. In this paper we present a formal operational semantics for the kernel of Eden, or more precisely, for a λ-calculus widened with explicit parallelism and potentially infinite communication channels. Eden overrides the lazy nature of Haskell on behalf of parallelism. This interplay between laziness and eagerness is accurately described by the semantics proposed here, which is based on Launchbury's natural semantics for lazy evaluation, and is expressed through a two-level transition system: a lower level for the local and independent evaluation of each process, and an upper one for the coordination between all the parallel processes in the system. As processes are created either under demand or in a speculative way, different scheduling strategies are possible — ranging from a minimal one that only allows the main thread to evolve, to a maximal one that evolves in parallel every active binding.

scholarly journals From Interpreter to Logic Engine by Defunctionalization

2003 ◽  
Vol 10 (25) ◽  
Author(s):  
Dariusz Biernacki ◽  
Olivier Danvy
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Operational Semantics ◽  
Lambda Calculus ◽  
Transition System ◽  
Abstract Machine ◽  
Logic Programming Language ◽  
Delimited Continuations ◽  
Simple Logic ◽  
Control Operators

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds's defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink in previous work (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.<br /><br />Superseded by BRICS-RS-04-5.

Target-oriented Petri Net Synthesis

2020 ◽  
Author(s):  
Eike Best ◽  
Raymond Devillers ◽  
Evgeny Erofeev ◽  
Harro Wimmel
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Transition System ◽  
Efficient Synthesis ◽  
Transition Systems ◽  
Np Complete ◽  
Full Class ◽  
Petri Net Synthesis ◽  
Labelled Transition System ◽  
Additional Constraints

When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.

Service Discovery and Composition Based on Contracts and Choreographic Descriptions

2012 ◽  
pp. 60-88
Author(s):  
Mario Bravetti ◽  
Gianluigi Zavattaro
Keyword(s):  
Service Discovery ◽  
Operational Semantics ◽  
Asynchronous Communication ◽  
Synchronous Communication ◽  
Transition Systems ◽  
Service Contracts ◽  
Contract Compliance ◽  
Service Oriented ◽  
Labeled Transition System ◽  
Contract Language

The authors discuss the interplay between the notions of contract compliance, contract refinement, and choreography conformance in the context of service oriented computing, by considering both synchronous and asynchronous communication. Service contracts are specified in a language independent way by means of finite labeled transition systems. In this way, the theory is general and foundational as the authors abstract away from the syntax of contracts and simply assume that a contract language has an operational semantics defined in terms of a labeled transition system. The chapter makes a comparative analysis of synchronous and asynchronous communication. Concerning the latter, a realistic scenario is considered in which services are endowed with queues used to store the received messages. In the simpler context of synchronous communication, the authors are able to resort to the theory of fair testing to provide decidability results.

scholarly journals Approximate Analyzing of Labeled Transition Systems

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Qiong Yu ◽  
Shihan Yang ◽  
Jinzhao Wu
Keyword(s):  
Control Systems ◽  
Linear Systems ◽  
Matrix Decomposition ◽  
Transition System ◽  
Formal Semantic ◽  
Semantic Model ◽  
Transition Systems ◽  
State Space Explosion ◽  
Normal Circumstance ◽  
Time Linear

As the most important formal semantic model, labeled transition systems are widely used, which can describe the general concurrent systems or control systems without disturbance. However, under normal circumstance, transition systems are complex and difficult to use due to large amount of calculation and the state space explosion problems. In order to overcome these problems, approximate equivalent labeled transition systems are proposed by means of incomplete low-up matrix decomposition factorization. This technique can reduce the complexity of computation and calculate under the allowing errors. As for continuous-time linear systems, we develop a modeling method of approximated transition system based on the approximate solution of matrix, which provides a facility for approximately formal semantic modeling for linear systems and to effectively analyze errors. An example of application in the context of linear systems without disturbances is studied.

MODEL CHECKING OF COMPONENT BASED SOFTWARE USING COMPOSITIONAL REDUCTIONS

2008 ◽  
Vol 18 (05) ◽  
pp. 683-712 ◽  
Author(s):  
MOHAMMAD IZADI ◽  
ALI MOVAGHAR
Keyword(s):  
Model Checking ◽  
Composition Operators ◽  
Linear Time ◽  
Operational Semantics ◽  
Computing System ◽  
Transition System ◽  
Compositional Model ◽  
Temporal Properties ◽  
Labeled Transition System ◽  
Constraint Automata

A component-based computing system consists of two main parts: a set of components and a coordination subsystem. Reo is an exogenous coordination language for compositional construction of the coordination subsystem. Constraint automaton has been defined as the operational semantics of Reo. The main goal of this paper is to prepare a model checking method for verifying linear time temporal properties of component-based systems whose coordinating subsystems are modeled by Reo and components are modeled by labeled transition systems. For this purpose, we introduce modified definitions of constraint automata and their composition operators by which, every constraint automaton can be considered as a labeled transition system and each labeled transition system can be translated into a constraint automaton. We show that failure-based equivalences CFFD and NDFD are congruences with respect to the composition operators of constraint automata. Also we present a method for compositional model checking of component-based systems using these equivalences for reducing the sizes of constraint automata models.

scholarly journals Natural Quantum Operational Semantics with Predicates

2008 ◽  
Vol 18 (3) ◽  
pp. 341-359 ◽  
Author(s):  
Marek Sawerwain ◽  
Roman Gielerak
Keyword(s):  
Positive Operator ◽  
Operational Semantics ◽  
General Definition ◽  
Completely Positive Maps ◽  
Transition Systems ◽  
Positive Operator Valued Measures ◽  
Labelled Transition Systems ◽  
Positive Maps ◽  
Definition Of ◽  
Positive Operator Valued Measure

Natural Quantum Operational Semantics with PredicatesA general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the existence of a GSOS format for quantum labelled transition systems. The first theorem is a slight generalisation of D'Hondt and Panagaden's theorem about the quantum weakest precondition in terms of discrete support positive operator-valued measures.

Sign in / Sign up

Export Citation Format

Share Document