Sciweavers

656 search results - page 17 / 132
» A Formalization of Transition P Systems
Sort
View
81
Voted
FORMATS
2006
Springer
15 years 1 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
72
Voted
FOSSACS
2010
Springer
15 years 4 months ago
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building in...
Andrei Popescu, Elsa L. Gunter
111
Voted
SACMAT
2009
ACM
15 years 4 months ago
Towards formal security analysis of GTRBAC using timed automata
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
90
Voted
ENTCS
2008
91views more  ENTCS 2008»
14 years 9 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
ENTCS
2008
90views more  ENTCS 2008»
14 years 9 months ago
Instantaneous Transitions in Esterel
Esterel is an imperative synchronous programming language for the specification of deterministic concurrent reactive systems. While providing the usual control-flow constructs--se...
Olivier Tardieu, Stephen A. Edwards